/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/mix044_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:35:04,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:35:04,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:35:04,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:35:04,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:35:04,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:35:04,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:35:04,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:35:04,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:35:04,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:35:04,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:35:04,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:35:04,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:35:04,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:35:04,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:35:04,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:35:04,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:35:04,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:35:04,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:35:04,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:35:04,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:35:04,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:35:04,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:35:04,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:35:04,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:35:04,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:35:04,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:35:04,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:35:04,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:35:04,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:35:04,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:35:04,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:35:04,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:35:04,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:35:04,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:35:04,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:35:04,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:35:04,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:35:04,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:35:04,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:35:04,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:35:04,877 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-18 13:35:04,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:35:04,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:35:04,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:35:04,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:35:04,899 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:35:04,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:35:04,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:35:04,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:35:04,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:35:04,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:35:04,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:35:04,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:35:04,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:35:04,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:35:04,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:35:04,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:35:04,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:35:04,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:35:04,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:35:04,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:35:04,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:35:04,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:35:04,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:35:04,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:35:04,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:35:05,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:35:05,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:35:05,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:35:05,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:35:05,190 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:35:05,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-18 13:35:05,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c326cc9c/37aad1f0fac0463eb2eea7544c1e07ee/FLAGb5b86b95a [2019-12-18 13:35:05,834 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:35:05,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-18 13:35:05,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c326cc9c/37aad1f0fac0463eb2eea7544c1e07ee/FLAGb5b86b95a [2019-12-18 13:35:06,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c326cc9c/37aad1f0fac0463eb2eea7544c1e07ee [2019-12-18 13:35:06,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:35:06,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:35:06,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:35:06,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:35:06,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:35:06,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06, skipping insertion in model container [2019-12-18 13:35:06,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:35:06,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:35:06,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:35:06,732 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:35:06,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:35:06,890 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:35:06,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06 WrapperNode [2019-12-18 13:35:06,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:35:06,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:35:06,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:35:06,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:35:06,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:35:06,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:35:06,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:35:06,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:35:06,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... [2019-12-18 13:35:06,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:35:06,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:35:06,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:35:06,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:35:06,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:35:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:35:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:35:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:35:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:35:07,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:35:07,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:35:07,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:35:07,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:35:07,068 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:35:07,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:35:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:35:07,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:35:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:35:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:35:07,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:35:07,071 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:35:07,872 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:35:07,872 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:35:07,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:35:07 BoogieIcfgContainer [2019-12-18 13:35:07,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:35:07,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:35:07,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:35:07,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:35:07,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:35:06" (1/3) ... [2019-12-18 13:35:07,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bec8e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:35:07, skipping insertion in model container [2019-12-18 13:35:07,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:35:06" (2/3) ... [2019-12-18 13:35:07,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bec8e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:35:07, skipping insertion in model container [2019-12-18 13:35:07,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:35:07" (3/3) ... [2019-12-18 13:35:07,882 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2019-12-18 13:35:07,890 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:35:07,890 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:35:07,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:35:07,898 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:35:07,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,969 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,969 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,970 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,970 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,970 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,974 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,975 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,993 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,994 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:07,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:35:08,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:35:08,031 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:35:08,032 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:35:08,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:35:08,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:35:08,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:35:08,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:35:08,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:35:08,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:35:08,050 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 13:35:08,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:35:08,140 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:35:08,140 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:35:08,157 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:35:08,178 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:35:08,264 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:35:08,264 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:35:08,273 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:35:08,295 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:35:08,296 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:35:13,524 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:35:13,659 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:35:13,680 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 13:35:13,680 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 13:35:13,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:35:16,578 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 13:35:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 13:35:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:35:16,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:16,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:16,587 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 13:35:16,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:16,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626699547] [2019-12-18 13:35:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:16,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626699547] [2019-12-18 13:35:16,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:16,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:35:16,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488582533] [2019-12-18 13:35:16,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:16,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:17,006 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 13:35:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:17,733 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 13:35:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:17,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:35:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:18,356 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 13:35:18,357 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 13:35:18,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 13:35:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 13:35:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 13:35:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 13:35:22,176 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 13:35:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:22,177 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 13:35:22,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 13:35:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:35:22,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:22,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:22,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 13:35:22,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:22,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188296850] [2019-12-18 13:35:22,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:22,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188296850] [2019-12-18 13:35:22,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:22,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:35:22,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584837095] [2019-12-18 13:35:22,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:35:22,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:35:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:35:22,288 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 13:35:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:23,280 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 13:35:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:35:23,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:35:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:23,666 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 13:35:23,667 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 13:35:23,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:35:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 13:35:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 13:35:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 13:35:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 13:35:26,229 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 13:35:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:26,230 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 13:35:26,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:35:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 13:35:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:35:26,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:26,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:26,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 13:35:26,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:26,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983634029] [2019-12-18 13:35:26,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:26,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983634029] [2019-12-18 13:35:26,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:26,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:35:26,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065536848] [2019-12-18 13:35:26,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:26,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:26,696 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 13:35:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:26,912 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 13:35:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:26,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:35:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:26,997 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 13:35:26,998 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 13:35:26,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 13:35:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 13:35:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 13:35:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 13:35:30,285 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 13:35:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:30,286 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 13:35:30,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 13:35:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:35:30,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:30,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:30,290 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 13:35:30,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:30,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728136605] [2019-12-18 13:35:30,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:30,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728136605] [2019-12-18 13:35:30,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:30,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:35:30,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610981256] [2019-12-18 13:35:30,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:35:30,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:35:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:35:30,378 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 13:35:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:30,447 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 13:35:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:35:30,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:35:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:30,471 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 13:35:30,472 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 13:35:30,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:35:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 13:35:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 13:35:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 13:35:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 13:35:31,059 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 13:35:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:31,060 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 13:35:31,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:35:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 13:35:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:35:31,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:31,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:31,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 13:35:31,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:31,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932044337] [2019-12-18 13:35:31,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:31,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932044337] [2019-12-18 13:35:31,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:31,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:35:31,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676101681] [2019-12-18 13:35:31,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:35:31,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:35:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:35:31,119 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 13:35:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:31,166 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 13:35:31,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:35:31,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:35:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:31,171 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 13:35:31,171 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 13:35:31,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:35:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 13:35:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 13:35:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 13:35:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 13:35:31,216 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 13:35:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:31,216 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 13:35:31,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:35:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 13:35:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:35:31,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:31,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:31,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 13:35:31,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:31,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43799608] [2019-12-18 13:35:31,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:31,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43799608] [2019-12-18 13:35:31,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:31,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:35:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289202328] [2019-12-18 13:35:31,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:35:31,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:35:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:35:31,294 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 13:35:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:31,341 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 13:35:31,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:35:31,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:35:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:31,344 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 13:35:31,344 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 13:35:31,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:35:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 13:35:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 13:35:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:35:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 13:35:31,365 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 13:35:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:31,365 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 13:35:31,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:35:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 13:35:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:35:31,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:31,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:31,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 13:35:31,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:31,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370958348] [2019-12-18 13:35:31,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:31,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370958348] [2019-12-18 13:35:31,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:31,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:35:31,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928827054] [2019-12-18 13:35:31,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:31,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:31,474 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 13:35:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:31,527 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 13:35:31,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:31,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:35:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:31,530 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:35:31,530 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:35:31,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:35:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 13:35:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 13:35:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 13:35:31,551 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 13:35:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:31,553 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 13:35:31,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 13:35:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:35:31,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:31,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:31,559 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 13:35:31,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:31,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584798897] [2019-12-18 13:35:31,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:31,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584798897] [2019-12-18 13:35:31,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:31,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:35:31,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032929676] [2019-12-18 13:35:31,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:31,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:31,663 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 13:35:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:31,718 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 13:35:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:31,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:35:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:31,722 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:35:31,722 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:35:31,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:35:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 13:35:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 13:35:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 13:35:31,741 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 13:35:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:31,741 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 13:35:31,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 13:35:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:35:31,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:31,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:31,746 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 13:35:31,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:31,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288811149] [2019-12-18 13:35:31,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:31,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288811149] [2019-12-18 13:35:31,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:31,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:35:31,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540867389] [2019-12-18 13:35:31,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:35:31,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:35:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:35:31,851 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 13:35:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:32,087 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 13:35:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:35:32,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:35:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:32,092 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 13:35:32,092 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 13:35:32,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:35:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 13:35:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 13:35:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 13:35:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 13:35:32,117 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 13:35:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:32,118 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 13:35:32,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:35:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 13:35:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:35:32,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:32,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:32,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 13:35:32,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:32,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432159482] [2019-12-18 13:35:32,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:32,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432159482] [2019-12-18 13:35:32,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:32,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:35:32,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227603263] [2019-12-18 13:35:32,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:35:32,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:32,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:35:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:35:32,274 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 13:35:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:32,638 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 13:35:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:35:32,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:35:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:32,644 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 13:35:32,645 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 13:35:32,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:35:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 13:35:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 13:35:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 13:35:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 13:35:32,667 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 13:35:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:32,667 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 13:35:32,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:35:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 13:35:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:35:32,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:32,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:32,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 13:35:32,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:32,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499334658] [2019-12-18 13:35:32,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:32,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499334658] [2019-12-18 13:35:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:32,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:35:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49227799] [2019-12-18 13:35:32,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:32,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:32,787 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 3 states. [2019-12-18 13:35:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:32,839 INFO L93 Difference]: Finished difference Result 1502 states and 4314 transitions. [2019-12-18 13:35:32,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:32,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:35:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:32,842 INFO L225 Difference]: With dead ends: 1502 [2019-12-18 13:35:32,842 INFO L226 Difference]: Without dead ends: 1502 [2019-12-18 13:35:32,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-12-18 13:35:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1081. [2019-12-18 13:35:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-18 13:35:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-18 13:35:32,863 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 58 [2019-12-18 13:35:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:32,864 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-18 13:35:32,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-18 13:35:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:35:32,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:32,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:32,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-18 13:35:32,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:32,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989487720] [2019-12-18 13:35:32,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:33,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989487720] [2019-12-18 13:35:33,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:33,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:35:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031541569] [2019-12-18 13:35:33,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:35:33,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:35:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:35:33,611 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 7 states. [2019-12-18 13:35:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:33,838 INFO L93 Difference]: Finished difference Result 2116 states and 5762 transitions. [2019-12-18 13:35:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:35:33,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 13:35:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:33,843 INFO L225 Difference]: With dead ends: 2116 [2019-12-18 13:35:33,843 INFO L226 Difference]: Without dead ends: 1445 [2019-12-18 13:35:33,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:35:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-18 13:35:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 951. [2019-12-18 13:35:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-18 13:35:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-18 13:35:33,870 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-18 13:35:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:33,870 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-18 13:35:33,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:35:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-18 13:35:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:35:33,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:33,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:33,873 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 2 times [2019-12-18 13:35:33,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:33,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377807990] [2019-12-18 13:35:33,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:34,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377807990] [2019-12-18 13:35:34,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:34,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:35:34,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576059665] [2019-12-18 13:35:34,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:35:34,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:35:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:35:34,015 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 5 states. [2019-12-18 13:35:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:34,071 INFO L93 Difference]: Finished difference Result 1190 states and 3130 transitions. [2019-12-18 13:35:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:35:34,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 13:35:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:34,074 INFO L225 Difference]: With dead ends: 1190 [2019-12-18 13:35:34,075 INFO L226 Difference]: Without dead ends: 694 [2019-12-18 13:35:34,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:35:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-18 13:35:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2019-12-18 13:35:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-18 13:35:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-18 13:35:34,088 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-18 13:35:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:34,088 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-18 13:35:34,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:35:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-18 13:35:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:35:34,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:34,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:34,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 3 times [2019-12-18 13:35:34,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:34,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122530583] [2019-12-18 13:35:34,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:34,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122530583] [2019-12-18 13:35:34,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:34,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:35:34,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417043230] [2019-12-18 13:35:34,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:35:34,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:35:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:35:34,234 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 6 states. [2019-12-18 13:35:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:34,296 INFO L93 Difference]: Finished difference Result 913 states and 2132 transitions. [2019-12-18 13:35:34,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:35:34,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 13:35:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:34,297 INFO L225 Difference]: With dead ends: 913 [2019-12-18 13:35:34,297 INFO L226 Difference]: Without dead ends: 290 [2019-12-18 13:35:34,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:35:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-12-18 13:35:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-12-18 13:35:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-18 13:35:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-18 13:35:34,302 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-18 13:35:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:34,302 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-18 13:35:34,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:35:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-18 13:35:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:35:34,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:34,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:34,304 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 4 times [2019-12-18 13:35:34,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:34,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196432452] [2019-12-18 13:35:34,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:34,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196432452] [2019-12-18 13:35:34,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:34,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:35:34,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530420557] [2019-12-18 13:35:34,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:35:34,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:35:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:34,368 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-18 13:35:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:34,381 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-18 13:35:34,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:35:34,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:35:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:34,382 INFO L225 Difference]: With dead ends: 269 [2019-12-18 13:35:34,382 INFO L226 Difference]: Without dead ends: 269 [2019-12-18 13:35:34,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:35:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-18 13:35:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-18 13:35:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 13:35:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 13:35:34,386 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-18 13:35:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:34,386 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 13:35:34,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:35:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 13:35:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:35:34,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:34,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:34,388 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-18 13:35:34,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:34,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829297533] [2019-12-18 13:35:34,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:35,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829297533] [2019-12-18 13:35:35,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:35,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 13:35:35,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952625369] [2019-12-18 13:35:35,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 13:35:35,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 13:35:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:35:35,016 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 20 states. [2019-12-18 13:35:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:36,911 INFO L93 Difference]: Finished difference Result 654 states and 1116 transitions. [2019-12-18 13:35:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:35:36,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-12-18 13:35:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:36,913 INFO L225 Difference]: With dead ends: 654 [2019-12-18 13:35:36,913 INFO L226 Difference]: Without dead ends: 622 [2019-12-18 13:35:36,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1444, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 13:35:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-18 13:35:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 325. [2019-12-18 13:35:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-18 13:35:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 565 transitions. [2019-12-18 13:35:36,919 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 565 transitions. Word has length 60 [2019-12-18 13:35:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:36,919 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 565 transitions. [2019-12-18 13:35:36,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 13:35:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 565 transitions. [2019-12-18 13:35:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:35:36,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:36,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:36,920 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1213917214, now seen corresponding path program 2 times [2019-12-18 13:35:36,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:36,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788846364] [2019-12-18 13:35:36,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:35:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:35:37,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788846364] [2019-12-18 13:35:37,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:35:37,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:35:37,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907586707] [2019-12-18 13:35:37,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:35:37,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:35:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:35:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:35:37,236 INFO L87 Difference]: Start difference. First operand 325 states and 565 transitions. Second operand 12 states. [2019-12-18 13:35:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:35:37,651 INFO L93 Difference]: Finished difference Result 487 states and 830 transitions. [2019-12-18 13:35:37,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:35:37,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:35:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:35:37,653 INFO L225 Difference]: With dead ends: 487 [2019-12-18 13:35:37,653 INFO L226 Difference]: Without dead ends: 455 [2019-12-18 13:35:37,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:35:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-18 13:35:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 345. [2019-12-18 13:35:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 13:35:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 13:35:37,658 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 13:35:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:35:37,658 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 13:35:37,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:35:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 13:35:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:35:37,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:35:37,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:35:37,660 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:35:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:35:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-18 13:35:37,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:35:37,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793858643] [2019-12-18 13:35:37,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:35:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:35:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:35:37,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:35:37,792 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:35:37,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff1_thd1~0_233 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1181~0.base_19|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19|) |v_ULTIMATE.start_main_~#t1181~0.offset_16| 0)) |v_#memory_int_25|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19|) 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= v_~y~0_38 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19| 1)) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1181~0.base_19| 4) |v_#length_29|) (= v_~__unbuffered_p3_EAX~0_243 0) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~x~0_42 0) (= v_~z$w_buff1_used~0_620 0) (= 0 |v_ULTIMATE.start_main_~#t1181~0.offset_16|) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_22|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t1181~0.base=|v_ULTIMATE.start_main_~#t1181~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_42, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_21|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_~#t1181~0.offset=|v_ULTIMATE.start_main_~#t1181~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1182~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1182~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t1184~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1181~0.base, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1183~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1181~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-18 13:35:37,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1182~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13|) |v_ULTIMATE.start_main_~#t1182~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1182~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13| 1) |v_#valid_48|) (= 0 |v_ULTIMATE.start_main_~#t1182~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1182~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1182~0.base] because there is no mapped edge [2019-12-18 13:35:37,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1183~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1183~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1183~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12|) |v_ULTIMATE.start_main_~#t1183~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1183~0.base_12| 4) |v_#length_21|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_12|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1183~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:35:37,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12|) |v_ULTIMATE.start_main_~#t1184~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1184~0.offset_10|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1184~0.base_12|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1184~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1184~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-18 13:35:37,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:35:37,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:35:37,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_19) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~x~0_32 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_28} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_28, ~x~0=v_~x~0_32, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:35:37,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-346717072 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-346717072 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-346717072| ~z$w_buff0_used~0_In-346717072) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-346717072| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-346717072, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-346717072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-346717072, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-346717072, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-346717072|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:35:37,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2146565527 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2146565527 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2146565527 |P2Thread1of1ForFork2_#t~ite3_Out2146565527|) (not .cse1)) (and (= ~z~0_In2146565527 |P2Thread1of1ForFork2_#t~ite3_Out2146565527|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2146565527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146565527, ~z$w_buff1~0=~z$w_buff1~0_In2146565527, ~z~0=~z~0_In2146565527} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2146565527|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2146565527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146565527, ~z$w_buff1~0=~z$w_buff1~0_In2146565527, ~z~0=~z~0_In2146565527} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:35:37,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In644224973 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In644224973 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In644224973 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In644224973 256)))) (or (and (= ~z$w_buff1_used~0_In644224973 |P3Thread1of1ForFork3_#t~ite12_Out644224973|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork3_#t~ite12_Out644224973| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In644224973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In644224973, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In644224973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644224973} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In644224973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In644224973, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In644224973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644224973, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out644224973|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:35:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1932122287 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1932122287 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1932122287) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1932122287 ~z$r_buff0_thd4~0_Out-1932122287)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1932122287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1932122287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1932122287, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1932122287, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1932122287|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:35:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-353367057 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-353367057 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-353367057 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-353367057 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-353367057| ~z$r_buff1_thd4~0_In-353367057)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite14_Out-353367057| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-353367057, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-353367057, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-353367057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-353367057} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-353367057, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-353367057, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-353367057|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-353367057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-353367057} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:35:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:35:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:35:37,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1558499306 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1558499306 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1558499306|)) (and (= ~z$w_buff0_used~0_In1558499306 |P2Thread1of1ForFork2_#t~ite5_Out1558499306|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1558499306, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1558499306} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1558499306|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1558499306, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1558499306} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:35:37,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1439578062 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1439578062 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1439578062 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1439578062 256)))) (or (and (= ~z$w_buff1_used~0_In1439578062 |P2Thread1of1ForFork2_#t~ite6_Out1439578062|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out1439578062|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1439578062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1439578062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1439578062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1439578062} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1439578062|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1439578062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1439578062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1439578062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1439578062} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:35:37,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-989812318 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-989812318 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-989812318| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-989812318| ~z$r_buff0_thd3~0_In-989812318)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-989812318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989812318} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-989812318, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-989812318, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-989812318|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:35:37,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-271670373 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-271670373 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-271670373 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-271670373 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-271670373 |P2Thread1of1ForFork2_#t~ite8_Out-271670373|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-271670373|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-271670373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271670373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271670373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271670373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-271670373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-271670373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-271670373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-271670373, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-271670373|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:35:37,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:35:37,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 13:35:37,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1436274517 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1436274517 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1436274517 |ULTIMATE.start_main_#t~ite19_Out1436274517|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1436274517| ~z$w_buff1~0_In1436274517)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1436274517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1436274517, ~z$w_buff1~0=~z$w_buff1~0_In1436274517, ~z~0=~z~0_In1436274517} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1436274517|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1436274517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1436274517, ~z$w_buff1~0=~z$w_buff1~0_In1436274517, ~z~0=~z~0_In1436274517} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:35:37,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:35:37,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-685995173 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-685995173 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-685995173|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-685995173| ~z$w_buff0_used~0_In-685995173) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-685995173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-685995173} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-685995173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-685995173, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-685995173|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:35:37,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1939200469 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1939200469 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1939200469 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1939200469 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1939200469 |ULTIMATE.start_main_#t~ite22_Out-1939200469|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1939200469|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1939200469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1939200469, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1939200469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1939200469} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1939200469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1939200469, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1939200469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1939200469, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1939200469|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:35:37,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-748670819 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-748670819 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-748670819|)) (and (= ~z$r_buff0_thd0~0_In-748670819 |ULTIMATE.start_main_#t~ite23_Out-748670819|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-748670819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-748670819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-748670819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-748670819, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-748670819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:35:37,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1267264250 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1267264250 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1267264250 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1267264250 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1267264250 |ULTIMATE.start_main_#t~ite24_Out1267264250|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out1267264250|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1267264250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1267264250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1267264250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1267264250} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1267264250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1267264250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1267264250, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1267264250|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1267264250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:35:37,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1344989038 256)))) (or (and (= ~z$w_buff1_used~0_In1344989038 |ULTIMATE.start_main_#t~ite40_Out1344989038|) (= |ULTIMATE.start_main_#t~ite39_In1344989038| |ULTIMATE.start_main_#t~ite39_Out1344989038|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite40_Out1344989038| |ULTIMATE.start_main_#t~ite39_Out1344989038|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1344989038 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1344989038 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1344989038 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1344989038 256)))) .cse0 (= ~z$w_buff1_used~0_In1344989038 |ULTIMATE.start_main_#t~ite39_Out1344989038|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1344989038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1344989038, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1344989038|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1344989038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1344989038, ~weak$$choice2~0=~weak$$choice2~0_In1344989038} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1344989038, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1344989038|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1344989038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1344989038, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1344989038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1344989038, ~weak$$choice2~0=~weak$$choice2~0_In1344989038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:35:37,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:35:37,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-599937734 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-599937734| ~z$r_buff1_thd0~0_In-599937734) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-599937734| |ULTIMATE.start_main_#t~ite45_Out-599937734|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-599937734| ~z$r_buff1_thd0~0_In-599937734) (= |ULTIMATE.start_main_#t~ite45_Out-599937734| |ULTIMATE.start_main_#t~ite46_Out-599937734|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-599937734 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-599937734 256)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-599937734 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-599937734 256))))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599937734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599937734, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-599937734, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599937734, ~weak$$choice2~0=~weak$$choice2~0_In-599937734, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-599937734|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599937734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599937734, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-599937734, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599937734, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-599937734|, ~weak$$choice2~0=~weak$$choice2~0_In-599937734, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-599937734|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:35:37,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:35:37,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 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_8, 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-18 13:35:37,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:35:37 BasicIcfg [2019-12-18 13:35:37,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:35:37,935 INFO L168 Benchmark]: Toolchain (without parser) took 31807.84 ms. Allocated memory was 138.9 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -990.2 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,936 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.37 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,940 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,941 INFO L168 Benchmark]: RCFGBuilder took 876.25 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,941 INFO L168 Benchmark]: TraceAbstraction took 30053.01 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.4 MB in the beginning and 1.1 GB in the end (delta: -990.5 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:35:37,950 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.37 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.25 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30053.01 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.4 MB in the beginning and 1.1 GB in the end (delta: -990.5 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1833 SDtfs, 1905 SDslu, 4748 SDs, 0 SdLazy, 2732 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred 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: 10.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 7601 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 173404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...