/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:13:10,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:13:10,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:13:10,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:13:10,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:13:10,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:13:10,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:13:10,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:13:10,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:13:10,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:13:10,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:13:10,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:13:10,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:13:10,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:13:10,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:13:10,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:13:10,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:13:10,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:13:10,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:13:10,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:13:10,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:13:10,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:13:10,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:13:10,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:13:10,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:13:10,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:13:10,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:13:10,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:13:10,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:13:10,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:13:10,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:13:10,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:13:10,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:13:10,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:13:10,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:13:10,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:13:10,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:13:10,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:13:10,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:13:10,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:13:10,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:13:10,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:13:10,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:13:10,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:13:10,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:13:10,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:13:10,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:13:10,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:13:10,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:13:10,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:13:10,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:13:10,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:13:10,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:13:10,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:13:10,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:13:10,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:13:10,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:13:10,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:13:10,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:13:10,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:13:10,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:13:10,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:13:10,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:13:10,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:13:10,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:13:10,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:13:10,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:13:10,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:13:10,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:13:10,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:13:10,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:13:10,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:13:11,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:13:11,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:13:11,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:13:11,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:13:11,194 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:13:11,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-27 00:13:11,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a077c9cdb/9c05262fce8b4aa0b476db064a4b6bc7/FLAGbc85a74ab [2019-12-27 00:13:11,809 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:13:11,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-27 00:13:11,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a077c9cdb/9c05262fce8b4aa0b476db064a4b6bc7/FLAGbc85a74ab [2019-12-27 00:13:12,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a077c9cdb/9c05262fce8b4aa0b476db064a4b6bc7 [2019-12-27 00:13:12,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:13:12,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:13:12,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:12,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:13:12,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:13:12,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12, skipping insertion in model container [2019-12-27 00:13:12,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:13:12,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:13:12,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:12,753 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:13:12,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:12,901 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:13:12,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12 WrapperNode [2019-12-27 00:13:12,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:12,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:12,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:13:12,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:13:12,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:12,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:13:12,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:13:12,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:13:12,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:12,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:13,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:13,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:13,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... [2019-12-27 00:13:13,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:13:13,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:13:13,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:13:13,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:13:13,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:13:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:13:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:13:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:13:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:13:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:13:13,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:13:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:13:13,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:13:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:13:13,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:13:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:13:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:13:13,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:13:13,089 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:13:13,833 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:13:13,833 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:13:13,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:13 BoogieIcfgContainer [2019-12-27 00:13:13,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:13:13,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:13:13,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:13:13,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:13:13,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:13:12" (1/3) ... [2019-12-27 00:13:13,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ca488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:13, skipping insertion in model container [2019-12-27 00:13:13,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:12" (2/3) ... [2019-12-27 00:13:13,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ca488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:13, skipping insertion in model container [2019-12-27 00:13:13,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:13" (3/3) ... [2019-12-27 00:13:13,848 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2019-12-27 00:13:13,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:13:13,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:13:13,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:13:13,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:13:13,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,931 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,931 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:13,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:13:13,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:13:13,990 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:13:13,990 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:13:13,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:13:13,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:13:13,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:13:13,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:13:13,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:13:14,024 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 00:13:14,026 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 00:13:14,116 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 00:13:14,116 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:14,129 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:13:14,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 00:13:14,195 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 00:13:14,195 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:14,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:13:14,214 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 00:13:14,215 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:13:19,102 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 00:13:19,211 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 00:13:19,233 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-27 00:13:19,233 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 00:13:19,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-27 00:13:20,111 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-27 00:13:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-27 00:13:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:13:20,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:20,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:20,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-27 00:13:20,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:20,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432683006] [2019-12-27 00:13:20,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:20,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432683006] [2019-12-27 00:13:20,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:20,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:13:20,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908093482] [2019-12-27 00:13:20,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:20,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:20,365 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-27 00:13:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:20,768 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-27 00:13:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:20,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 00:13:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:20,910 INFO L225 Difference]: With dead ends: 15586 [2019-12-27 00:13:20,911 INFO L226 Difference]: Without dead ends: 15248 [2019-12-27 00:13:20,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-27 00:13:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-27 00:13:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-27 00:13:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-27 00:13:22,375 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-27 00:13:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:22,376 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-27 00:13:22,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-27 00:13:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:13:22,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:22,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:22,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-27 00:13:22,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:22,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197209465] [2019-12-27 00:13:22,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:22,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197209465] [2019-12-27 00:13:22,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:22,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:22,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633171513] [2019-12-27 00:13:22,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:22,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:22,542 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 4 states. [2019-12-27 00:13:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:22,993 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-27 00:13:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:22,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:13:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:23,092 INFO L225 Difference]: With dead ends: 24364 [2019-12-27 00:13:23,092 INFO L226 Difference]: Without dead ends: 24350 [2019-12-27 00:13:23,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-27 00:13:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-27 00:13:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-27 00:13:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-27 00:13:24,079 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-27 00:13:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:24,080 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-27 00:13:24,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-27 00:13:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:13:24,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:24,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:24,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-27 00:13:24,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:24,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163136363] [2019-12-27 00:13:24,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:24,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163136363] [2019-12-27 00:13:24,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:24,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:24,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817755447] [2019-12-27 00:13:24,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:24,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:24,171 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-27 00:13:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:24,227 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-27 00:13:24,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:24,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:13:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:24,257 INFO L225 Difference]: With dead ends: 12388 [2019-12-27 00:13:24,258 INFO L226 Difference]: Without dead ends: 12388 [2019-12-27 00:13:24,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-27 00:13:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-27 00:13:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-27 00:13:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-27 00:13:25,524 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-27 00:13:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:25,524 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-27 00:13:25,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-27 00:13:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:13:25,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:25,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:25,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-27 00:13:25,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:25,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306349429] [2019-12-27 00:13:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:25,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306349429] [2019-12-27 00:13:25,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:25,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:25,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913224675] [2019-12-27 00:13:25,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:25,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:25,564 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 4 states. [2019-12-27 00:13:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:25,590 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-27 00:13:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:13:25,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:13:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:25,595 INFO L225 Difference]: With dead ends: 1903 [2019-12-27 00:13:25,595 INFO L226 Difference]: Without dead ends: 1903 [2019-12-27 00:13:25,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-27 00:13:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-27 00:13:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-27 00:13:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-27 00:13:25,629 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-27 00:13:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:25,629 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-27 00:13:25,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-27 00:13:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:13:25,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:25,632 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] [2019-12-27 00:13:25,632 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-27 00:13:25,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:25,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541629529] [2019-12-27 00:13:25,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:25,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541629529] [2019-12-27 00:13:25,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:25,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:13:25,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704375113] [2019-12-27 00:13:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:25,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:25,689 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 5 states. [2019-12-27 00:13:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:25,714 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-27 00:13:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:25,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 00:13:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:25,716 INFO L225 Difference]: With dead ends: 669 [2019-12-27 00:13:25,716 INFO L226 Difference]: Without dead ends: 669 [2019-12-27 00:13:25,717 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-27 00:13:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-27 00:13:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-27 00:13:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 00:13:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-27 00:13:25,727 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-27 00:13:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:25,728 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-27 00:13:25,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-27 00:13:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:25,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:25,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:25,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-27 00:13:25,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:25,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866123799] [2019-12-27 00:13:25,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:25,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866123799] [2019-12-27 00:13:25,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:25,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:25,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448482228] [2019-12-27 00:13:25,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:25,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:25,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:25,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:25,856 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-27 00:13:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:25,892 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-27 00:13:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:25,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:13:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:25,895 INFO L225 Difference]: With dead ends: 610 [2019-12-27 00:13:25,895 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 00:13:25,895 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-27 00:13:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 00:13:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-27 00:13:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 00:13:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-27 00:13:25,906 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-27 00:13:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:25,907 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-27 00:13:25,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-27 00:13:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:25,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:25,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:25,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:25,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-27 00:13:25,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:25,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29183414] [2019-12-27 00:13:25,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:26,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29183414] [2019-12-27 00:13:26,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:26,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:26,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364130306] [2019-12-27 00:13:26,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:26,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:26,013 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 3 states. [2019-12-27 00:13:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:26,033 INFO L93 Difference]: Finished difference Result 605 states and 1389 transitions. [2019-12-27 00:13:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:26,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:13:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:26,036 INFO L225 Difference]: With dead ends: 605 [2019-12-27 00:13:26,036 INFO L226 Difference]: Without dead ends: 605 [2019-12-27 00:13:26,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-27 00:13:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-12-27 00:13:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 00:13:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1389 transitions. [2019-12-27 00:13:26,048 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1389 transitions. Word has length 54 [2019-12-27 00:13:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:26,048 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1389 transitions. [2019-12-27 00:13:26,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1389 transitions. [2019-12-27 00:13:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:13:26,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:26,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:26,051 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1649873410, now seen corresponding path program 1 times [2019-12-27 00:13:26,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:26,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695587415] [2019-12-27 00:13:26,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:26,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695587415] [2019-12-27 00:13:26,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:26,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:13:26,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826966479] [2019-12-27 00:13:26,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:13:26,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:13:26,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:26,211 INFO L87 Difference]: Start difference. First operand 605 states and 1389 transitions. Second operand 8 states. [2019-12-27 00:13:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:26,798 INFO L93 Difference]: Finished difference Result 1054 states and 2429 transitions. [2019-12-27 00:13:26,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:13:26,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 00:13:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:26,801 INFO L225 Difference]: With dead ends: 1054 [2019-12-27 00:13:26,801 INFO L226 Difference]: Without dead ends: 1054 [2019-12-27 00:13:26,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:13:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-12-27 00:13:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 743. [2019-12-27 00:13:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-27 00:13:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1718 transitions. [2019-12-27 00:13:26,813 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1718 transitions. Word has length 55 [2019-12-27 00:13:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:26,813 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1718 transitions. [2019-12-27 00:13:26,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:13:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1718 transitions. [2019-12-27 00:13:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:13:26,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:26,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:26,816 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1435069556, now seen corresponding path program 2 times [2019-12-27 00:13:26,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:26,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288488251] [2019-12-27 00:13:26,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:26,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288488251] [2019-12-27 00:13:26,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:26,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:26,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261994308] [2019-12-27 00:13:26,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:26,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:26,914 INFO L87 Difference]: Start difference. First operand 743 states and 1718 transitions. Second operand 5 states. [2019-12-27 00:13:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:27,094 INFO L93 Difference]: Finished difference Result 963 states and 2203 transitions. [2019-12-27 00:13:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:27,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 00:13:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:27,096 INFO L225 Difference]: With dead ends: 963 [2019-12-27 00:13:27,096 INFO L226 Difference]: Without dead ends: 963 [2019-12-27 00:13:27,097 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-27 00:13:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-27 00:13:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 735. [2019-12-27 00:13:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-12-27 00:13:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1698 transitions. [2019-12-27 00:13:27,110 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1698 transitions. Word has length 55 [2019-12-27 00:13:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:27,111 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1698 transitions. [2019-12-27 00:13:27,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1698 transitions. [2019-12-27 00:13:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:13:27,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:27,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:27,114 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2008175174, now seen corresponding path program 3 times [2019-12-27 00:13:27,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:27,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661933557] [2019-12-27 00:13:27,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:27,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661933557] [2019-12-27 00:13:27,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:27,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:27,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982499695] [2019-12-27 00:13:27,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:27,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:27,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:27,210 INFO L87 Difference]: Start difference. First operand 735 states and 1698 transitions. Second operand 3 states. [2019-12-27 00:13:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:27,252 INFO L93 Difference]: Finished difference Result 735 states and 1697 transitions. [2019-12-27 00:13:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:27,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:13:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:27,255 INFO L225 Difference]: With dead ends: 735 [2019-12-27 00:13:27,255 INFO L226 Difference]: Without dead ends: 735 [2019-12-27 00:13:27,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-27 00:13:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 498. [2019-12-27 00:13:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-27 00:13:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1149 transitions. [2019-12-27 00:13:27,265 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1149 transitions. Word has length 55 [2019-12-27 00:13:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:27,265 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1149 transitions. [2019-12-27 00:13:27,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1149 transitions. [2019-12-27 00:13:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:27,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:27,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:27,268 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash -529490788, now seen corresponding path program 1 times [2019-12-27 00:13:27,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:27,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425931896] [2019-12-27 00:13:27,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:27,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425931896] [2019-12-27 00:13:27,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:27,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:27,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215518736] [2019-12-27 00:13:27,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:27,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:27,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:27,397 INFO L87 Difference]: Start difference. First operand 498 states and 1149 transitions. Second operand 6 states. [2019-12-27 00:13:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:27,471 INFO L93 Difference]: Finished difference Result 892 states and 1870 transitions. [2019-12-27 00:13:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:27,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 00:13:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:27,473 INFO L225 Difference]: With dead ends: 892 [2019-12-27 00:13:27,473 INFO L226 Difference]: Without dead ends: 579 [2019-12-27 00:13:27,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-27 00:13:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 436. [2019-12-27 00:13:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 00:13:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-27 00:13:27,482 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 56 [2019-12-27 00:13:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:27,482 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-27 00:13:27,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-27 00:13:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:27,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:27,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:27,484 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 2 times [2019-12-27 00:13:27,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:27,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3422548] [2019-12-27 00:13:27,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3422548] [2019-12-27 00:13:27,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:27,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:27,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483314127] [2019-12-27 00:13:27,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:27,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:27,609 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 6 states. [2019-12-27 00:13:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:27,689 INFO L93 Difference]: Finished difference Result 707 states and 1527 transitions. [2019-12-27 00:13:27,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:27,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 00:13:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:27,690 INFO L225 Difference]: With dead ends: 707 [2019-12-27 00:13:27,690 INFO L226 Difference]: Without dead ends: 244 [2019-12-27 00:13:27,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-27 00:13:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 220. [2019-12-27 00:13:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 00:13:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-27 00:13:27,695 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-27 00:13:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:27,695 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-27 00:13:27,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-27 00:13:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:27,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:27,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:27,697 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 3 times [2019-12-27 00:13:27,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:27,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19864772] [2019-12-27 00:13:27,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:28,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19864772] [2019-12-27 00:13:28,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:28,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:13:28,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026941520] [2019-12-27 00:13:28,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:13:28,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:28,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:13:28,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:13:28,013 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 12 states. [2019-12-27 00:13:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:28,427 INFO L93 Difference]: Finished difference Result 384 states and 657 transitions. [2019-12-27 00:13:28,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:13:28,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 00:13:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:28,428 INFO L225 Difference]: With dead ends: 384 [2019-12-27 00:13:28,428 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 00:13:28,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:13:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 00:13:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-27 00:13:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 00:13:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-27 00:13:28,436 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-27 00:13:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:28,436 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-27 00:13:28,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:13:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-27 00:13:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:28,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:28,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:28,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 4 times [2019-12-27 00:13:28,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:28,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203932080] [2019-12-27 00:13:28,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:28,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203932080] [2019-12-27 00:13:28,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:28,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:13:28,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401335329] [2019-12-27 00:13:28,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:13:28,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:13:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:13:28,776 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 12 states. [2019-12-27 00:13:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:29,076 INFO L93 Difference]: Finished difference Result 420 states and 708 transitions. [2019-12-27 00:13:29,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:13:29,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 00:13:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:29,078 INFO L225 Difference]: With dead ends: 420 [2019-12-27 00:13:29,078 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 00:13:29,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:13:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 00:13:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-27 00:13:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 00:13:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-27 00:13:29,085 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-27 00:13:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:29,086 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-27 00:13:29,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:13:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-27 00:13:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:13:29,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:29,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:29,087 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 5 times [2019-12-27 00:13:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:29,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344695439] [2019-12-27 00:13:29,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:29,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:13:29,233 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:13:29,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27|) |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27| 1) |v_#valid_59|) (= 0 v_~y$r_buff1_thd1~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27|) 0) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2498~0.base_27|) (= |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2498~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_20|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t2498~0.offset=|v_ULTIMATE.start_main_~#t2498~0.offset_20|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_20|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2498~0.base=|v_ULTIMATE.start_main_~#t2498~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2499~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2499~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2500~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2498~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t2500~0.base, #memory_int, ULTIMATE.start_main_~#t2498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:29,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2499~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2499~0.base_9| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9|) |v_ULTIMATE.start_main_~#t2499~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2499~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2499~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2499~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 00:13:29,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10|) |v_ULTIMATE.start_main_~#t2500~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2500~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2500~0.offset_9|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2500~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2500~0.offset] because there is no mapped edge [2019-12-27 00:13:29,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff0~0_In-542128265 ~y$w_buff1~0_Out-542128265) (= ~y$w_buff0_used~0_Out-542128265 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-542128265| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-542128265) (= ~y$w_buff0~0_Out-542128265 2) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-542128265| 1) (= ~y$w_buff1_used~0_Out-542128265 ~y$w_buff0_used~0_In-542128265) (= P2Thread1of1ForFork0_~arg.offset_Out-542128265 |P2Thread1of1ForFork0_#in~arg.offset_In-542128265|) (= 0 (mod ~y$w_buff1_used~0_Out-542128265 256)) (= |P2Thread1of1ForFork0_#in~arg.base_In-542128265| P2Thread1of1ForFork0_~arg.base_Out-542128265)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-542128265|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-542128265, ~y$w_buff0~0=~y$w_buff0~0_In-542128265, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-542128265|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-542128265, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-542128265|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-542128265|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-542128265, ~y$w_buff1~0=~y$w_buff1~0_Out-542128265, ~y$w_buff0~0=~y$w_buff0~0_Out-542128265, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-542128265, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-542128265|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-542128265, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-542128265} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:29,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 00:13:29,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-583708809 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-583708809 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-583708809|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-583708809 |P2Thread1of1ForFork0_#t~ite11_Out-583708809|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-583708809, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-583708809} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-583708809, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-583708809|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-583708809} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 00:13:29,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In478297074 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In478297074 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out478297074| |P1Thread1of1ForFork2_#t~ite3_Out478297074|))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite3_Out478297074| ~y$w_buff1~0_In478297074) (not .cse1) (not .cse2)) (and (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite3_Out478297074| ~y~0_In478297074) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In478297074, ~y$w_buff1~0=~y$w_buff1~0_In478297074, ~y~0=~y~0_In478297074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478297074} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In478297074, ~y$w_buff1~0=~y$w_buff1~0_In478297074, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out478297074|, ~y~0=~y~0_In478297074, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out478297074|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478297074} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 00:13:29,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In84430660 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In84430660 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In84430660 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In84430660 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In84430660 |P2Thread1of1ForFork0_#t~ite12_Out84430660|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out84430660|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In84430660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84430660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In84430660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84430660} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In84430660, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84430660, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out84430660|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In84430660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84430660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 00:13:29,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2024830056 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2024830056 256)))) (or (and (= ~y$w_buff0_used~0_In2024830056 |P1Thread1of1ForFork2_#t~ite5_Out2024830056|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out2024830056| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2024830056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2024830056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2024830056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2024830056, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out2024830056|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 00:13:29,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1561365822 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1561365822 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1561365822 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1561365822 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1561365822| ~y$w_buff1_used~0_In-1561365822) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-1561365822|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1561365822, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561365822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1561365822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1561365822} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1561365822, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561365822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1561365822, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1561365822|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1561365822} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 00:13:29,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-493060000 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-493060000 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-493060000| 0)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out-493060000| ~y$r_buff0_thd2~0_In-493060000) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-493060000, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-493060000} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-493060000, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-493060000, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-493060000|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 00:13:29,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In29717044 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In29717044 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In29717044 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In29717044 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out29717044| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite8_Out29717044| ~y$r_buff1_thd2~0_In29717044)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In29717044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29717044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29717044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29717044} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In29717044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29717044, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out29717044|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In29717044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In29717044} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 00:13:29,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 00:13:29,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In104977487 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In104977487 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In104977487 ~y$r_buff0_thd3~0_Out104977487)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out104977487 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In104977487, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In104977487} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In104977487, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out104977487, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out104977487|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 00:13:29,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1658427156 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1658427156 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1658427156 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1658427156 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-1658427156| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-1658427156| ~y$r_buff1_thd3~0_In-1658427156)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1658427156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658427156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1658427156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658427156} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1658427156|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1658427156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658427156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1658427156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658427156} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 00:13:29,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 00:13:29,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:13:29,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In622357253 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In622357253 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out622357253| |ULTIMATE.start_main_#t~ite18_Out622357253|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out622357253| ~y~0_In622357253) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite18_Out622357253| ~y$w_buff1~0_In622357253)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In622357253, ~y~0=~y~0_In622357253, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In622357253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In622357253} OutVars{~y$w_buff1~0=~y$w_buff1~0_In622357253, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out622357253|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out622357253|, ~y~0=~y~0_In622357253, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In622357253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In622357253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:13:29,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-482764581 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-482764581 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-482764581|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-482764581| ~y$w_buff0_used~0_In-482764581)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-482764581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-482764581} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-482764581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-482764581, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-482764581|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:13:29,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1952741010 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1952741010 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1952741010 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1952741010 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1952741010 |ULTIMATE.start_main_#t~ite21_Out1952741010|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out1952741010| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1952741010, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1952741010, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1952741010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1952741010} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1952741010, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1952741010, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1952741010|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1952741010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1952741010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:13:29,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1732946215 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1732946215 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1732946215|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1732946215| ~y$r_buff0_thd0~0_In1732946215)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1732946215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1732946215} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1732946215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1732946215, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1732946215|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:13:29,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-840908967 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-840908967 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-840908967 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-840908967 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-840908967|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-840908967 |ULTIMATE.start_main_#t~ite23_Out-840908967|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-840908967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840908967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840908967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840908967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-840908967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840908967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840908967, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-840908967|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840908967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 00:13:29,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-170228911 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-170228911 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-170228911 256)) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-170228911 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-170228911 256) 0)))) (= |ULTIMATE.start_main_#t~ite29_Out-170228911| |ULTIMATE.start_main_#t~ite30_Out-170228911|) (= |ULTIMATE.start_main_#t~ite29_Out-170228911| ~y$w_buff0~0_In-170228911) .cse1) (and (= |ULTIMATE.start_main_#t~ite29_In-170228911| |ULTIMATE.start_main_#t~ite29_Out-170228911|) (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-170228911| ~y$w_buff0~0_In-170228911)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-170228911, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-170228911|, ~y$w_buff0~0=~y$w_buff0~0_In-170228911, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170228911, ~weak$$choice2~0=~weak$$choice2~0_In-170228911, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170228911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170228911} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-170228911|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-170228911, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-170228911|, ~y$w_buff0~0=~y$w_buff0~0_In-170228911, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170228911, ~weak$$choice2~0=~weak$$choice2~0_In-170228911, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170228911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170228911} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 00:13:29,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In688836182 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite33_Out688836182| |ULTIMATE.start_main_#t~ite32_Out688836182|) (= ~y$w_buff1~0_In688836182 |ULTIMATE.start_main_#t~ite32_Out688836182|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In688836182 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In688836182 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In688836182 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In688836182 256))))) (and (= ~y$w_buff1~0_In688836182 |ULTIMATE.start_main_#t~ite33_Out688836182|) (= |ULTIMATE.start_main_#t~ite32_In688836182| |ULTIMATE.start_main_#t~ite32_Out688836182|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In688836182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In688836182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In688836182, ~weak$$choice2~0=~weak$$choice2~0_In688836182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In688836182, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In688836182|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In688836182} OutVars{~y$w_buff1~0=~y$w_buff1~0_In688836182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In688836182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In688836182, ~weak$$choice2~0=~weak$$choice2~0_In688836182, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out688836182|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In688836182, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out688836182|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In688836182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 00:13:29,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1638362731 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out1638362731| |ULTIMATE.start_main_#t~ite36_Out1638362731|) (= |ULTIMATE.start_main_#t~ite35_Out1638362731| ~y$w_buff0_used~0_In1638362731) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1638362731 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1638362731 256))) (= 0 (mod ~y$w_buff0_used~0_In1638362731 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1638362731 256) 0))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In1638362731| |ULTIMATE.start_main_#t~ite35_Out1638362731|) (= |ULTIMATE.start_main_#t~ite36_Out1638362731| ~y$w_buff0_used~0_In1638362731)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1638362731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1638362731, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1638362731|, ~weak$$choice2~0=~weak$$choice2~0_In1638362731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1638362731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1638362731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1638362731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1638362731, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1638362731|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1638362731|, ~weak$$choice2~0=~weak$$choice2~0_In1638362731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1638362731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1638362731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 00:13:29,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 00:13:29,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:13:29,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:13:29,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:13:29 BasicIcfg [2019-12-27 00:13:29,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:13:29,367 INFO L168 Benchmark]: Toolchain (without parser) took 17270.20 ms. Allocated memory was 143.7 MB in the beginning and 815.8 MB in the end (delta: 672.1 MB). Free memory was 100.5 MB in the beginning and 494.6 MB in the end (delta: -394.1 MB). Peak memory consumption was 278.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,368 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.59 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 153.7 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.14 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,370 INFO L168 Benchmark]: Boogie Preprocessor took 47.64 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,371 INFO L168 Benchmark]: RCFGBuilder took 816.61 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,372 INFO L168 Benchmark]: TraceAbstraction took 15528.15 ms. Allocated memory was 201.3 MB in the beginning and 815.8 MB in the end (delta: 614.5 MB). Free memory was 101.2 MB in the beginning and 494.6 MB in the end (delta: -393.4 MB). Peak memory consumption was 221.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:29,376 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.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.59 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 153.7 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.14 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.64 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.61 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15528.15 ms. Allocated memory was 201.3 MB in the beginning and 815.8 MB in the end (delta: 614.5 MB). Free memory was 101.2 MB in the beginning and 494.6 MB in the end (delta: -393.4 MB). Peak memory consumption was 221.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1305 SDtfs, 1118 SDslu, 3126 SDs, 0 SdLazy, 1312 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 3786 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 126546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...