/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/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:06:47,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:06:47,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:06:47,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:06:47,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:06:47,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:06:47,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:06:47,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:06:47,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:06:47,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:06:47,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:06:47,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:06:47,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:06:47,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:06:47,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:06:47,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:06:47,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:06:47,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:06:47,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:06:47,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:06:47,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:06:47,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:06:47,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:06:47,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:06:47,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:06:47,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:06:47,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:06:47,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:06:47,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:06:47,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:06:47,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:06:47,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:06:47,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:06:47,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:06:47,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:06:47,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:06:47,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:06:47,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:06:47,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:06:47,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:06:47,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:06:47,891 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:06:47,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:06:47,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:06:47,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:06:47,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:06:47,915 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:06:47,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:06:47,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:06:47,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:06:47,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:06:47,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:06:47,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:06:47,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:06:47,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:06:47,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:06:47,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:06:47,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:06:47,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:06:47,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:06:47,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:06:47,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:06:47,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:06:47,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:06:47,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:06:47,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:06:47,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:06:47,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:06:47,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:06:47,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:06:47,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:06:47,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:06:48,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:06:48,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:06:48,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:06:48,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:06:48,207 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:06:48,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-18 13:06:48,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976587473/45ed6894d6544e508d5c6b0c8427125e/FLAGafe2de035 [2019-12-18 13:06:48,861 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:06:48,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-18 13:06:48,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976587473/45ed6894d6544e508d5c6b0c8427125e/FLAGafe2de035 [2019-12-18 13:06:49,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976587473/45ed6894d6544e508d5c6b0c8427125e [2019-12-18 13:06:49,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:06:49,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:06:49,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:49,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:06:49,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:06:49,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:49,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637331f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49, skipping insertion in model container [2019-12-18 13:06:49,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:49,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:06:49,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:06:49,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:49,764 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:06:49,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:49,910 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:06:49,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49 WrapperNode [2019-12-18 13:06:49,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:49,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:49,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:06:49,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:06:49,921 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:06:49" (1/1) ... [2019-12-18 13:06:49,941 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:06:49" (1/1) ... [2019-12-18 13:06:49,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:49,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:06:49,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:06:49,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:06:49,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:49,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:49,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:49,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:50,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:50,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:50,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (1/1) ... [2019-12-18 13:06:50,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:06:50,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:06:50,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:06:50,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:06:50,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (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:06:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:06:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:06:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:06:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:06:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:06:50,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:06:50,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:06:50,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:06:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:06:50,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:06:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:06:50,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:06:50,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:06:50,104 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:06:50,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:06:50,904 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:06:50,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:50 BoogieIcfgContainer [2019-12-18 13:06:50,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:06:50,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:06:50,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:06:50,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:06:50,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:06:49" (1/3) ... [2019-12-18 13:06:50,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f400e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:50, skipping insertion in model container [2019-12-18 13:06:50,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:49" (2/3) ... [2019-12-18 13:06:50,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f400e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:50, skipping insertion in model container [2019-12-18 13:06:50,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:50" (3/3) ... [2019-12-18 13:06:50,918 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2019-12-18 13:06:50,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:06:50,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:06:50,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:06:50,943 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:06:50,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:50,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:51,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:06:51,088 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:06:51,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:06:51,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:06:51,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:06:51,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:06:51,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:06:51,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:06:51,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:06:51,105 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:06:51,107 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:06:51,192 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:06:51,192 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:51,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:06:51,240 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:06:51,285 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:06:51,286 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:51,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:06:51,314 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 13:06:51,315 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:06:55,940 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-18 13:06:56,294 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:06:56,435 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:06:56,458 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-18 13:06:56,458 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 13:06:56,462 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 13:07:14,603 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-18 13:07:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-18 13:07:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:07:14,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:14,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:07:14,612 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-18 13:07:14,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:14,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641919967] [2019-12-18 13:07:14,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:14,826 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:07:14,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641919967] [2019-12-18 13:07:14,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:14,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:07:14,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749996670] [2019-12-18 13:07:14,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:14,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:14,853 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-18 13:07:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:18,601 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-18 13:07:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:07:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:19,560 INFO L225 Difference]: With dead ends: 114778 [2019-12-18 13:07:19,560 INFO L226 Difference]: Without dead ends: 112412 [2019-12-18 13:07:19,562 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:07:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-18 13:07:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-18 13:07:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-18 13:07:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-18 13:07:26,935 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-18 13:07:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:26,935 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-18 13:07:26,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-18 13:07:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:07:26,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:26,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:26,939 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-18 13:07:26,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:26,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944823856] [2019-12-18 13:07:26,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:27,089 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:07:27,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944823856] [2019-12-18 13:07:27,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:27,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:27,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558991305] [2019-12-18 13:07:27,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:27,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:27,094 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-18 13:07:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:31,872 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-18 13:07:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:31,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:07:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:33,257 INFO L225 Difference]: With dead ends: 180702 [2019-12-18 13:07:33,258 INFO L226 Difference]: Without dead ends: 180653 [2019-12-18 13:07:33,259 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:07:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-18 13:07:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-18 13:07:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-18 13:07:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-18 13:07:46,634 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-18 13:07:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:46,634 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-18 13:07:46,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-18 13:07:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:07:46,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:46,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:46,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-18 13:07:46,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:46,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519533625] [2019-12-18 13:07:46,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:46,745 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:07:46,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519533625] [2019-12-18 13:07:46,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:46,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:46,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392520707] [2019-12-18 13:07:46,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:46,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:46,748 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-18 13:07:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:54,310 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-18 13:07:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:54,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:07:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:55,237 INFO L225 Difference]: With dead ends: 235681 [2019-12-18 13:07:55,237 INFO L226 Difference]: Without dead ends: 235618 [2019-12-18 13:07:55,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-18 13:08:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-18 13:08:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-18 13:08:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-18 13:08:06,543 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-18 13:08:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:06,544 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-18 13:08:06,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:08:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-18 13:08:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:08:06,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:06,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:06,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-18 13:08:06,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:06,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509573487] [2019-12-18 13:08:06,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:06,610 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:08:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509573487] [2019-12-18 13:08:06,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:06,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:06,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109231298] [2019-12-18 13:08:06,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:06,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:06,612 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-18 13:08:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:06,750 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-18 13:08:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:06,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:08:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:12,676 INFO L225 Difference]: With dead ends: 39466 [2019-12-18 13:08:12,676 INFO L226 Difference]: Without dead ends: 39466 [2019-12-18 13:08:12,676 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:08:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-18 13:08:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-18 13:08:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-18 13:08:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-18 13:08:13,299 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-18 13:08:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:13,299 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-18 13:08:13,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-18 13:08:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:08:13,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:13,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] [2019-12-18 13:08:13,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-18 13:08:13,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:13,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33577011] [2019-12-18 13:08:13,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:13,413 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:08:13,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33577011] [2019-12-18 13:08:13,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:13,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:13,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230385584] [2019-12-18 13:08:13,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:13,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:13,415 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-18 13:08:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:14,269 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-18 13:08:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:08:14,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 13:08:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:14,356 INFO L225 Difference]: With dead ends: 53323 [2019-12-18 13:08:14,356 INFO L226 Difference]: Without dead ends: 53310 [2019-12-18 13:08:14,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-18 13:08:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-18 13:08:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-18 13:08:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-18 13:08:15,452 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-18 13:08:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:15,452 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-18 13:08:15,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-18 13:08:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:08:15,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:15,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:15,466 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:15,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:15,466 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-18 13:08:15,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:15,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609999450] [2019-12-18 13:08:15,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:15,540 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:08:15,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609999450] [2019-12-18 13:08:15,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:15,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:15,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926606177] [2019-12-18 13:08:15,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:08:15,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:08:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:08:15,542 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-18 13:08:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:15,586 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-18 13:08:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:08:15,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:08:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:15,598 INFO L225 Difference]: With dead ends: 7581 [2019-12-18 13:08:15,598 INFO L226 Difference]: Without dead ends: 7581 [2019-12-18 13:08:15,599 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:08:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-18 13:08:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-18 13:08:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-18 13:08:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-18 13:08:15,702 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-18 13:08:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:15,703 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-18 13:08:15,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:08:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-18 13:08:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:08:15,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:15,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:15,715 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-18 13:08:15,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:15,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128088740] [2019-12-18 13:08:15,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:15,817 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:08:15,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128088740] [2019-12-18 13:08:15,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:15,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:08:15,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346840101] [2019-12-18 13:08:15,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:15,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:15,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:15,820 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-18 13:08:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:15,863 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-18 13:08:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:08:15,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 13:08:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:15,872 INFO L225 Difference]: With dead ends: 5402 [2019-12-18 13:08:15,872 INFO L226 Difference]: Without dead ends: 5402 [2019-12-18 13:08:15,872 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:08:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-18 13:08:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-18 13:08:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-18 13:08:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-18 13:08:15,959 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-18 13:08:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:15,960 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-18 13:08:15,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-18 13:08:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:08:15,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:15,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:15,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-18 13:08:15,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:15,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906012632] [2019-12-18 13:08:15,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:16,058 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:08:16,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906012632] [2019-12-18 13:08:16,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:16,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:16,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091914602] [2019-12-18 13:08:16,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:16,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:16,062 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-18 13:08:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:16,125 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-18 13:08:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:16,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:08:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:16,134 INFO L225 Difference]: With dead ends: 4998 [2019-12-18 13:08:16,134 INFO L226 Difference]: Without dead ends: 4998 [2019-12-18 13:08:16,135 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:08:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-18 13:08:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-18 13:08:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 13:08:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-18 13:08:16,203 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-18 13:08:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:16,203 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-18 13:08:16,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-18 13:08:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:08:16,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:16,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:16,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-18 13:08:16,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:16,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971920784] [2019-12-18 13:08:16,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:16,324 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:08:16,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971920784] [2019-12-18 13:08:16,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:16,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:16,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163424270] [2019-12-18 13:08:16,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:16,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:16,327 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 3 states. [2019-12-18 13:08:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:16,356 INFO L93 Difference]: Finished difference Result 4994 states and 14195 transitions. [2019-12-18 13:08:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:16,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:08:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:16,363 INFO L225 Difference]: With dead ends: 4994 [2019-12-18 13:08:16,364 INFO L226 Difference]: Without dead ends: 4994 [2019-12-18 13:08:16,364 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:08:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-18 13:08:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4994. [2019-12-18 13:08:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 13:08:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14195 transitions. [2019-12-18 13:08:16,437 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14195 transitions. Word has length 65 [2019-12-18 13:08:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:16,437 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14195 transitions. [2019-12-18 13:08:16,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14195 transitions. [2019-12-18 13:08:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:16,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:16,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:16,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1760720695, now seen corresponding path program 1 times [2019-12-18 13:08:16,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:16,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161823198] [2019-12-18 13:08:16,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:16,540 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:08:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161823198] [2019-12-18 13:08:16,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:16,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:16,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31005452] [2019-12-18 13:08:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:16,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:16,542 INFO L87 Difference]: Start difference. First operand 4994 states and 14195 transitions. Second operand 5 states. [2019-12-18 13:08:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:16,861 INFO L93 Difference]: Finished difference Result 7330 states and 20675 transitions. [2019-12-18 13:08:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:08:16,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 13:08:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:16,873 INFO L225 Difference]: With dead ends: 7330 [2019-12-18 13:08:16,873 INFO L226 Difference]: Without dead ends: 7330 [2019-12-18 13:08:16,873 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:08:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2019-12-18 13:08:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6065. [2019-12-18 13:08:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6065 states. [2019-12-18 13:08:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 17257 transitions. [2019-12-18 13:08:16,973 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 17257 transitions. Word has length 66 [2019-12-18 13:08:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:16,973 INFO L462 AbstractCegarLoop]: Abstraction has 6065 states and 17257 transitions. [2019-12-18 13:08:16,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 17257 transitions. [2019-12-18 13:08:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:16,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:16,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:16,982 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1764113003, now seen corresponding path program 2 times [2019-12-18 13:08:16,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:16,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959122076] [2019-12-18 13:08:16,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:17,075 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:08:17,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959122076] [2019-12-18 13:08:17,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:17,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:17,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936993035] [2019-12-18 13:08:17,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:17,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:17,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:17,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:17,078 INFO L87 Difference]: Start difference. First operand 6065 states and 17257 transitions. Second operand 5 states. [2019-12-18 13:08:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:17,478 INFO L93 Difference]: Finished difference Result 8773 states and 24705 transitions. [2019-12-18 13:08:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:08:17,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 13:08:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:17,495 INFO L225 Difference]: With dead ends: 8773 [2019-12-18 13:08:17,495 INFO L226 Difference]: Without dead ends: 8773 [2019-12-18 13:08:17,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-18 13:08:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 6413. [2019-12-18 13:08:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-12-18 13:08:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 18290 transitions. [2019-12-18 13:08:17,660 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 18290 transitions. Word has length 66 [2019-12-18 13:08:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:17,660 INFO L462 AbstractCegarLoop]: Abstraction has 6413 states and 18290 transitions. [2019-12-18 13:08:17,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 18290 transitions. [2019-12-18 13:08:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:17,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:17,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:17,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 3 times [2019-12-18 13:08:17,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:17,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583583860] [2019-12-18 13:08:17,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:17,831 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:08:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583583860] [2019-12-18 13:08:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:17,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:17,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129614199] [2019-12-18 13:08:17,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:08:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:17,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:08:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:17,833 INFO L87 Difference]: Start difference. First operand 6413 states and 18290 transitions. Second operand 6 states. [2019-12-18 13:08:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:18,284 INFO L93 Difference]: Finished difference Result 8691 states and 24471 transitions. [2019-12-18 13:08:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:08:18,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 13:08:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:18,296 INFO L225 Difference]: With dead ends: 8691 [2019-12-18 13:08:18,297 INFO L226 Difference]: Without dead ends: 8691 [2019-12-18 13:08:18,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2019-12-18 13:08:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 6840. [2019-12-18 13:08:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2019-12-18 13:08:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19489 transitions. [2019-12-18 13:08:18,403 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19489 transitions. Word has length 66 [2019-12-18 13:08:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:18,403 INFO L462 AbstractCegarLoop]: Abstraction has 6840 states and 19489 transitions. [2019-12-18 13:08:18,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:08:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19489 transitions. [2019-12-18 13:08:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:18,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:18,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:18,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 4 times [2019-12-18 13:08:18,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115970878] [2019-12-18 13:08:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:18,491 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:08:18,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115970878] [2019-12-18 13:08:18,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:18,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:18,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584048096] [2019-12-18 13:08:18,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:18,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:18,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:18,493 INFO L87 Difference]: Start difference. First operand 6840 states and 19489 transitions. Second operand 3 states. [2019-12-18 13:08:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:18,557 INFO L93 Difference]: Finished difference Result 6840 states and 19488 transitions. [2019-12-18 13:08:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:18,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:08:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:18,567 INFO L225 Difference]: With dead ends: 6840 [2019-12-18 13:08:18,567 INFO L226 Difference]: Without dead ends: 6840 [2019-12-18 13:08:18,568 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:08:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2019-12-18 13:08:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4178. [2019-12-18 13:08:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-12-18 13:08:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 12093 transitions. [2019-12-18 13:08:18,721 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 12093 transitions. Word has length 66 [2019-12-18 13:08:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:18,721 INFO L462 AbstractCegarLoop]: Abstraction has 4178 states and 12093 transitions. [2019-12-18 13:08:18,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 12093 transitions. [2019-12-18 13:08:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:18,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:18,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:18,733 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1488093963, now seen corresponding path program 1 times [2019-12-18 13:08:18,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:18,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059437676] [2019-12-18 13:08:18,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:18,855 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:08:18,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059437676] [2019-12-18 13:08:18,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:18,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:18,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544924379] [2019-12-18 13:08:18,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:18,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:18,859 INFO L87 Difference]: Start difference. First operand 4178 states and 12093 transitions. Second operand 3 states. [2019-12-18 13:08:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:18,897 INFO L93 Difference]: Finished difference Result 3871 states and 10957 transitions. [2019-12-18 13:08:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:18,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:08:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:18,906 INFO L225 Difference]: With dead ends: 3871 [2019-12-18 13:08:18,906 INFO L226 Difference]: Without dead ends: 3871 [2019-12-18 13:08:18,908 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:08:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-18 13:08:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3183. [2019-12-18 13:08:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-18 13:08:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 9013 transitions. [2019-12-18 13:08:19,017 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 9013 transitions. Word has length 67 [2019-12-18 13:08:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:19,018 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 9013 transitions. [2019-12-18 13:08:19,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 9013 transitions. [2019-12-18 13:08:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:08:19,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:19,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:19,028 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-18 13:08:19,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:19,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379992237] [2019-12-18 13:08:19,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:19,317 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:08:19,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379992237] [2019-12-18 13:08:19,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:19,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:19,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493976790] [2019-12-18 13:08:19,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:08:19,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:19,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:08:19,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:19,320 INFO L87 Difference]: Start difference. First operand 3183 states and 9013 transitions. Second operand 7 states. [2019-12-18 13:08:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:19,515 INFO L93 Difference]: Finished difference Result 6802 states and 19408 transitions. [2019-12-18 13:08:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:08:19,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 13:08:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:19,522 INFO L225 Difference]: With dead ends: 6802 [2019-12-18 13:08:19,523 INFO L226 Difference]: Without dead ends: 3670 [2019-12-18 13:08:19,525 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:08:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-18 13:08:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 2607. [2019-12-18 13:08:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-12-18 13:08:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 7312 transitions. [2019-12-18 13:08:19,591 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 7312 transitions. Word has length 68 [2019-12-18 13:08:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:19,591 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 7312 transitions. [2019-12-18 13:08:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:08:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 7312 transitions. [2019-12-18 13:08:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:08:19,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:19,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:19,597 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-18 13:08:19,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:19,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583825230] [2019-12-18 13:08:19,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:19,737 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:08:19,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583825230] [2019-12-18 13:08:19,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:19,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:08:19,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537348219] [2019-12-18 13:08:19,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:19,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:19,741 INFO L87 Difference]: Start difference. First operand 2607 states and 7312 transitions. Second operand 5 states. [2019-12-18 13:08:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:19,802 INFO L93 Difference]: Finished difference Result 4523 states and 12685 transitions. [2019-12-18 13:08:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:08:19,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-18 13:08:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:19,807 INFO L225 Difference]: With dead ends: 4523 [2019-12-18 13:08:19,807 INFO L226 Difference]: Without dead ends: 1963 [2019-12-18 13:08:19,807 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:08:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-12-18 13:08:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-12-18 13:08:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 13:08:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5460 transitions. [2019-12-18 13:08:19,837 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5460 transitions. Word has length 68 [2019-12-18 13:08:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:19,837 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5460 transitions. [2019-12-18 13:08:19,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5460 transitions. [2019-12-18 13:08:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:08:19,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:19,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:19,841 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:19,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-18 13:08:19,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:19,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702463202] [2019-12-18 13:08:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:08:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:08:19,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:08:19,967 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:08:19,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20|) |v_ULTIMATE.start_main_~#t760~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX~0_23) (= (store .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20| 1) |v_#valid_55|) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= 0 v_~x$r_buff0_thd3~0_99) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (= 0 |v_ULTIMATE.start_main_~#t760~0.offset_17|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= v_~x$mem_tmp~0_22 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t760~0.base_20|) (= v_~__unbuffered_p2_EBX~0_23 0) (= 0 v_~x$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (= v_~__unbuffered_cnt~0_145 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t760~0.base_20| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20|) 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t760~0.base=|v_ULTIMATE.start_main_~#t760~0.base_20|, ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ULTIMATE.start_main_~#t760~0.offset=|v_ULTIMATE.start_main_~#t760~0.offset_17|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_21|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_17|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t760~0.base, ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t761~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t760~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t761~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t762~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:08:19,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t761~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t761~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t761~0.offset_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13|) |v_ULTIMATE.start_main_~#t761~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t761~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t761~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t761~0.base] because there is no mapped edge [2019-12-18 13:08:19,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (not (= |v_ULTIMATE.start_main_~#t762~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t762~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t762~0.base_13| 4) |v_#length_15|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t762~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13|) |v_ULTIMATE.start_main_~#t762~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t762~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:08:19,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:08:19,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-477017245 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-477017245 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-477017245 |P2Thread1of1ForFork2_#t~ite15_Out-477017245|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-477017245| ~x$w_buff1~0_In-477017245)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-477017245, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-477017245, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-477017245, ~x~0=~x~0_In-477017245} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-477017245|, ~x$w_buff1~0=~x$w_buff1~0_In-477017245, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-477017245, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-477017245, ~x~0=~x~0_In-477017245} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 13:08:19,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 13:08:19,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out2145797477| |P0Thread1of1ForFork0_#t~ite4_Out2145797477|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2145797477 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In2145797477 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out2145797477| ~x~0_In2145797477) (or .cse1 .cse2)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out2145797477| ~x$w_buff1~0_In2145797477) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2145797477, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2145797477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2145797477, ~x~0=~x~0_In2145797477} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out2145797477|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out2145797477|, ~x$w_buff1~0=~x$w_buff1~0_In2145797477, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2145797477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2145797477, ~x~0=~x~0_In2145797477} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:08:19,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In125916825 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In125916825 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out125916825| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out125916825| ~x$w_buff0_used~0_In125916825)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In125916825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In125916825} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out125916825|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In125916825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In125916825} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:08:19,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1221282062 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1221282062 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1221282062 |P2Thread1of1ForFork2_#t~ite17_Out1221282062|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1221282062|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1221282062, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1221282062} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1221282062, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1221282062|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1221282062} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 13:08:19,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1665638206 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1665638206 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1665638206 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1665638206 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out1665638206| ~x$w_buff1_used~0_In1665638206) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1665638206| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1665638206, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1665638206, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1665638206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1665638206} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1665638206, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1665638206, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1665638206, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1665638206|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1665638206} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 13:08:19,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-655452538 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-655452538 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-655452538 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-655452538 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-655452538|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-655452538 |P0Thread1of1ForFork0_#t~ite6_Out-655452538|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-655452538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-655452538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-655452538, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-655452538} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-655452538|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-655452538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-655452538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-655452538, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-655452538} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:08:19,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In242828090 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In242828090 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out242828090|)) (and (= ~x$r_buff0_thd3~0_In242828090 |P2Thread1of1ForFork2_#t~ite19_Out242828090|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In242828090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In242828090} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In242828090, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out242828090|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In242828090} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 13:08:19,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2086620302 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2086620302 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2086620302 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2086620302 256)))) (or (and (= ~x$r_buff1_thd3~0_In2086620302 |P2Thread1of1ForFork2_#t~ite20_Out2086620302|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out2086620302|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2086620302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2086620302, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2086620302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2086620302} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out2086620302|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2086620302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2086620302, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2086620302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2086620302} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 13:08:19,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:08:19,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1304423122 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1304423122 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1304423122| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1304423122 |P1Thread1of1ForFork1_#t~ite11_Out1304423122|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1304423122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304423122} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1304423122|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1304423122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304423122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:08:19,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-785676775 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-785676775 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-785676775 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-785676775 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-785676775|)) (and (= ~x$w_buff1_used~0_In-785676775 |P1Thread1of1ForFork1_#t~ite12_Out-785676775|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-785676775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-785676775, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-785676775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-785676775} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-785676775, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-785676775, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-785676775|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-785676775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-785676775} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:08:19,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1746682369 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1746682369 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1746682369) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1746682369 ~x$r_buff0_thd2~0_Out1746682369)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1746682369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1746682369} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1746682369|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1746682369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1746682369} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:08:19,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In150917854 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In150917854 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In150917854 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In150917854 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out150917854|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In150917854 |P1Thread1of1ForFork1_#t~ite14_Out150917854|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In150917854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In150917854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150917854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150917854} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In150917854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In150917854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In150917854, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out150917854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In150917854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:08:19,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:08:19,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In652375342 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In652375342 256)))) (or (and (= ~x$r_buff0_thd1~0_In652375342 |P0Thread1of1ForFork0_#t~ite7_Out652375342|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out652375342| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In652375342, ~x$w_buff0_used~0=~x$w_buff0_used~0_In652375342} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In652375342, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out652375342|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In652375342} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:08:19,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1821981268 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1821981268 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1821981268 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1821981268 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1821981268| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1821981268| ~x$r_buff1_thd1~0_In1821981268) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1821981268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1821981268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1821981268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1821981268} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1821981268, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1821981268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1821981268, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1821981268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1821981268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:08:19,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:08:19,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:08:19,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-491560548 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-491560548 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-491560548| |ULTIMATE.start_main_#t~ite25_Out-491560548|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-491560548| ~x$w_buff1~0_In-491560548) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out-491560548| ~x~0_In-491560548)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-491560548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-491560548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-491560548, ~x~0=~x~0_In-491560548} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-491560548, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-491560548|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-491560548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-491560548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-491560548, ~x~0=~x~0_In-491560548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 13:08:19,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1532211313 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1532211313 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1532211313 |ULTIMATE.start_main_#t~ite26_Out-1532211313|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1532211313|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1532211313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1532211313} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1532211313, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1532211313|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1532211313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 13:08:19,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In58954699 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In58954699 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In58954699 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In58954699 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out58954699|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In58954699 |ULTIMATE.start_main_#t~ite27_Out58954699|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In58954699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In58954699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In58954699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In58954699} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In58954699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In58954699, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out58954699|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In58954699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In58954699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 13:08:19,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2093128084 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2093128084 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-2093128084|)) (and (= ~x$r_buff0_thd0~0_In-2093128084 |ULTIMATE.start_main_#t~ite28_Out-2093128084|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2093128084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093128084} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2093128084, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-2093128084|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093128084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 13:08:19,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-395426080 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-395426080 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-395426080 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-395426080 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-395426080| ~x$r_buff1_thd0~0_In-395426080) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-395426080| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-395426080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-395426080, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-395426080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-395426080} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-395426080, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-395426080|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-395426080, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-395426080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-395426080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:08:20,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:08:20,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:08:20,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:08:20,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:08:20 BasicIcfg [2019-12-18 13:08:20,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:08:20,136 INFO L168 Benchmark]: Toolchain (without parser) took 91038.12 ms. Allocated memory was 145.2 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,137 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 156.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,142 INFO L168 Benchmark]: Boogie Preprocessor took 39.15 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,143 INFO L168 Benchmark]: RCFGBuilder took 885.51 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,144 INFO L168 Benchmark]: TraceAbstraction took 89226.61 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 13:08:20,153 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.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 156.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.15 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.51 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89226.61 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2367 SDtfs, 1695 SDslu, 3717 SDs, 0 SdLazy, 1832 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 75000 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 97696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...