/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/safe001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:20:59,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:20:59,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:20:59,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:20:59,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:20:59,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:20:59,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:20:59,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:20:59,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:20:59,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:20:59,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:20:59,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:20:59,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:20:59,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:20:59,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:20:59,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:20:59,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:20:59,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:20:59,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:20:59,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:20:59,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:20:59,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:20:59,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:20:59,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:20:59,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:20:59,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:20:59,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:20:59,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:20:59,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:20:59,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:20:59,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:20:59,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:20:59,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:20:59,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:20:59,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:20:59,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:20:59,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:20:59,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:20:59,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:20:59,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:20:59,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:20:59,964 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 14:20:59,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:20:59,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:20:59,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:20:59,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:20:59,989 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:20:59,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:20:59,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:20:59,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:20:59,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:20:59,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:20:59,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:20:59,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:20:59,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:20:59,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:20:59,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:20:59,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:20:59,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:20:59,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:20:59,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:20:59,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:20:59,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:20:59,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:20:59,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:20:59,994 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:20:59,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:21:00,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:21:00,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:21:00,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:21:00,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:21:00,289 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:21:00,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2019-12-18 14:21:00,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafdc7865/b89bd45d03624447bbbcaae37b55ea9d/FLAG70762f8ad [2019-12-18 14:21:00,966 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:21:00,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2019-12-18 14:21:00,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafdc7865/b89bd45d03624447bbbcaae37b55ea9d/FLAG70762f8ad [2019-12-18 14:21:01,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafdc7865/b89bd45d03624447bbbcaae37b55ea9d [2019-12-18 14:21:01,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:21:01,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:21:01,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:21:01,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:21:01,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:21:01,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:21:01" (1/1) ... [2019-12-18 14:21:01,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f98591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:01, skipping insertion in model container [2019-12-18 14:21:01,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:21:01" (1/1) ... [2019-12-18 14:21:01,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:21:01,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:21:01,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:21:01,870 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:21:01,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:21:02,047 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:21:02,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02 WrapperNode [2019-12-18 14:21:02,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:21:02,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:21:02,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:21:02,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:21:02,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:21:02,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:21:02,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:21:02,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:21:02,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (1/1) ... [2019-12-18 14:21:02,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:21:02,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:21:02,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:21:02,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:21:02,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (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 14:21:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:21:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:21:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:21:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:21:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:21:02,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:21:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:21:02,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:21:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:21:02,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:21:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:21:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:21:02,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:21:02,259 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 14:21:03,048 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:21:03,048 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:21:03,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:21:03 BoogieIcfgContainer [2019-12-18 14:21:03,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:21:03,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:21:03,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:21:03,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:21:03,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:21:01" (1/3) ... [2019-12-18 14:21:03,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27430883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:21:03, skipping insertion in model container [2019-12-18 14:21:03,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:21:02" (2/3) ... [2019-12-18 14:21:03,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27430883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:21:03, skipping insertion in model container [2019-12-18 14:21:03,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:21:03" (3/3) ... [2019-12-18 14:21:03,059 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.opt.i [2019-12-18 14:21:03,069 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:21:03,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:21:03,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:21:03,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:21:03,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,177 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,177 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:21:03,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:21:03,214 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:21:03,215 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:21:03,215 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:21:03,215 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:21:03,215 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:21:03,215 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:21:03,216 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:21:03,216 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:21:03,234 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:21:03,236 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:21:03,329 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:21:03,329 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:21:03,352 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:21:03,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:21:03,469 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:21:03,469 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:21:03,482 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:21:03,506 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 14:21:03,507 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:21:08,705 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:21:08,828 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:21:08,851 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 14:21:08,851 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 14:21:08,855 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 14:21:25,024 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 14:21:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 14:21:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:21:25,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:25,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:21:25,033 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 14:21:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 14:21:25,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:25,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371426025] [2019-12-18 14:21:25,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:25,298 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 14:21:25,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371426025] [2019-12-18 14:21:25,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:25,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:21:25,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268191214] [2019-12-18 14:21:25,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:21:25,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:21:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:21:25,326 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 14:21:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:28,580 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 14:21:28,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:21:28,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:21:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:29,449 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 14:21:29,449 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 14:21:29,451 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 14:21:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 14:21:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 14:21:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 14:21:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 14:21:40,538 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 14:21:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:40,539 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 14:21:40,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:21:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 14:21:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:21:40,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:40,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:40,543 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 14:21:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 14:21:40,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:40,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460675925] [2019-12-18 14:21:40,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:40,705 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 14:21:40,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460675925] [2019-12-18 14:21:40,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:40,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:21:40,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774262539] [2019-12-18 14:21:40,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:21:40,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:21:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:21:40,709 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 14:21:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:21:45,825 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 14:21:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:21:45,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:21:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:21:46,515 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 14:21:46,515 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 14:21:46,516 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 14:21:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 14:21:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 14:21:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 14:21:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 14:21:55,670 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 14:21:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:21:55,670 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 14:21:55,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:21:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 14:21:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:21:55,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:21:55,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:21:55,678 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 14:21:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:21:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 14:21:55,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:21:55,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295106784] [2019-12-18 14:21:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:21:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:21:55,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 14:21:55,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295106784] [2019-12-18 14:21:55,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:21:55,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:21:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465069716] [2019-12-18 14:21:55,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:21:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:21:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:21:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:21:55,835 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 14:22:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:02,062 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 14:22:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:22:02,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:22:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:03,332 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 14:22:03,332 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 14:22:03,333 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 14:22:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 14:22:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 14:22:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 14:22:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 14:22:13,458 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 14:22:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:13,459 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 14:22:13,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:22:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 14:22:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:22:13,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:13,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:22:13,463 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 14:22:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 14:22:13,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:13,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855039157] [2019-12-18 14:22:13,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:13,539 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 14:22:13,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855039157] [2019-12-18 14:22:13,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:13,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:13,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213911817] [2019-12-18 14:22:13,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:13,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:13,545 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 14:22:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:13,681 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 14:22:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:13,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:22:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:13,743 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 14:22:13,744 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 14:22:13,744 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 14:22:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 14:22:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 14:22:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 14:22:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 14:22:20,110 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 14:22:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:20,110 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 14:22:20,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 14:22:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:22:20,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:20,114 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 14:22:20,114 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 14:22:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 14:22:20,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:20,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911183934] [2019-12-18 14:22:20,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:20,211 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 14:22:20,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911183934] [2019-12-18 14:22:20,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:20,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:20,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621648526] [2019-12-18 14:22:20,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:22:20,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:22:20,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:20,214 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 14:22:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:21,034 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 14:22:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:22:21,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:22:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:21,119 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 14:22:21,119 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 14:22:21,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 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 14:22:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 14:22:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 14:22:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 14:22:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 14:22:22,150 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 14:22:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:22,150 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 14:22:22,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 14:22:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:22:22,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:22,162 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 14:22:22,162 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 14:22:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 14:22:22,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:22,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405865034] [2019-12-18 14:22:22,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:22,245 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 14:22:22,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405865034] [2019-12-18 14:22:22,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:22,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:22,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888448771] [2019-12-18 14:22:22,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:22:22,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:22:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:22:22,247 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 14:22:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:22,288 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 14:22:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:22:22,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:22:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:22,300 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 14:22:22,300 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 14:22:22,301 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 14:22:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 14:22:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 14:22:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 14:22:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 14:22:22,389 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 14:22:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:22,390 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 14:22:22,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:22:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 14:22:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:22:22,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:22,401 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 14:22:22,401 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 14:22:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 14:22:22,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:22,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12611327] [2019-12-18 14:22:22,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:22,477 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 14:22:22,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12611327] [2019-12-18 14:22:22,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:22,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:22:22,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363308701] [2019-12-18 14:22:22,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:22:22,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:22,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:22:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:22,479 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 14:22:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:22,516 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 14:22:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:22:22,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:22:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:22,526 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 14:22:22,526 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 14:22:22,527 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 14:22:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 14:22:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 14:22:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 14:22:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 14:22:22,598 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 14:22:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:22,599 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 14:22:22,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 14:22:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:22,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:22,606 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 14:22:22,607 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 14:22:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 14:22:22,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:22,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620551117] [2019-12-18 14:22:22,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:22,681 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 14:22:22,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620551117] [2019-12-18 14:22:22,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:22,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:22,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278099085] [2019-12-18 14:22:22,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:22,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:22,683 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:22:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:22,746 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 14:22:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:22,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:22,759 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:22:22,759 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:22:22,761 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 14:22:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:22:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:22:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:22:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 14:22:22,827 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 14:22:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:22,827 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 14:22:22,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 14:22:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:22,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:22,834 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 14:22:22,834 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 14:22:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 14:22:22,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:22,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694054677] [2019-12-18 14:22:22,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:22,914 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 14:22:22,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694054677] [2019-12-18 14:22:22,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:22,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:22:22,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807538119] [2019-12-18 14:22:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:22,916 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 14:22:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:22,969 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 14:22:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:22,978 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:22:22,978 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:22:22,979 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 14:22:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:22:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:22:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:22:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 14:22:23,050 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 14:22:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:23,051 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 14:22:23,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 14:22:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:22:23,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:23,058 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 14:22:23,058 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 14:22:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:23,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 14:22:23,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:23,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104748600] [2019-12-18 14:22:23,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:23,190 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 14:22:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104748600] [2019-12-18 14:22:23,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:23,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:23,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54045804] [2019-12-18 14:22:23,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:23,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:23,192 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:22:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:23,226 INFO L93 Difference]: Finished difference Result 4665 states and 13233 transitions. [2019-12-18 14:22:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:23,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:22:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:23,236 INFO L225 Difference]: With dead ends: 4665 [2019-12-18 14:22:23,236 INFO L226 Difference]: Without dead ends: 4665 [2019-12-18 14:22:23,236 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 14:22:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-12-18 14:22:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4665. [2019-12-18 14:22:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:22:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13233 transitions. [2019-12-18 14:22:23,324 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13233 transitions. Word has length 65 [2019-12-18 14:22:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:23,324 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13233 transitions. [2019-12-18 14:22:23,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13233 transitions. [2019-12-18 14:22:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:22:23,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:23,334 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 14:22:23,334 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 14:22:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1887448171, now seen corresponding path program 1 times [2019-12-18 14:22:23,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:23,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386087421] [2019-12-18 14:22:23,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:23,458 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 14:22:23,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386087421] [2019-12-18 14:22:23,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:23,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:22:23,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227430931] [2019-12-18 14:22:23,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:22:23,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:22:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:22:23,462 INFO L87 Difference]: Start difference. First operand 4665 states and 13233 transitions. Second operand 5 states. [2019-12-18 14:22:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:23,812 INFO L93 Difference]: Finished difference Result 6995 states and 19609 transitions. [2019-12-18 14:22:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:22:23,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:22:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:23,828 INFO L225 Difference]: With dead ends: 6995 [2019-12-18 14:22:23,828 INFO L226 Difference]: Without dead ends: 6995 [2019-12-18 14:22:23,829 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 14:22:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-18 14:22:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 4949. [2019-12-18 14:22:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-18 14:22:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-18 14:22:23,962 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 66 [2019-12-18 14:22:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:23,964 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-18 14:22:23,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:22:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-18 14:22:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:22:23,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:23,974 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 14:22:23,974 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 14:22:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash 284491425, now seen corresponding path program 2 times [2019-12-18 14:22:23,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:23,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516081901] [2019-12-18 14:22:23,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:24,120 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 14:22:24,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516081901] [2019-12-18 14:22:24,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:24,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:22:24,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336825094] [2019-12-18 14:22:24,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:22:24,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:22:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:22:24,122 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 6 states. [2019-12-18 14:22:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:24,594 INFO L93 Difference]: Finished difference Result 6941 states and 19455 transitions. [2019-12-18 14:22:24,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:22:24,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:22:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:24,606 INFO L225 Difference]: With dead ends: 6941 [2019-12-18 14:22:24,606 INFO L226 Difference]: Without dead ends: 6941 [2019-12-18 14:22:24,607 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 14:22:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-12-18 14:22:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5572. [2019-12-18 14:22:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-12-18 14:22:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 15823 transitions. [2019-12-18 14:22:24,914 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 15823 transitions. Word has length 66 [2019-12-18 14:22:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 15823 transitions. [2019-12-18 14:22:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:22:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 15823 transitions. [2019-12-18 14:22:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:22:24,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:24,926 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 14:22:24,926 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 14:22:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2082058241, now seen corresponding path program 3 times [2019-12-18 14:22:24,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:24,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802822354] [2019-12-18 14:22:24,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:25,025 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 14:22:25,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802822354] [2019-12-18 14:22:25,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:25,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:22:25,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413036021] [2019-12-18 14:22:25,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:22:25,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:22:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:22:25,027 INFO L87 Difference]: Start difference. First operand 5572 states and 15823 transitions. Second operand 6 states. [2019-12-18 14:22:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:25,492 INFO L93 Difference]: Finished difference Result 7758 states and 21651 transitions. [2019-12-18 14:22:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:22:25,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:22:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:25,504 INFO L225 Difference]: With dead ends: 7758 [2019-12-18 14:22:25,504 INFO L226 Difference]: Without dead ends: 7758 [2019-12-18 14:22:25,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:22:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-12-18 14:22:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 6183. [2019-12-18 14:22:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-12-18 14:22:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 17414 transitions. [2019-12-18 14:22:25,656 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 17414 transitions. Word has length 66 [2019-12-18 14:22:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:25,656 INFO L462 AbstractCegarLoop]: Abstraction has 6183 states and 17414 transitions. [2019-12-18 14:22:25,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:22:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 17414 transitions. [2019-12-18 14:22:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:22:25,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:25,669 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 14:22:25,670 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 14:22:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 504707035, now seen corresponding path program 4 times [2019-12-18 14:22:25,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:25,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982017343] [2019-12-18 14:22:25,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:25,731 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 14:22:25,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982017343] [2019-12-18 14:22:25,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:25,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600783339] [2019-12-18 14:22:25,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:25,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:25,733 INFO L87 Difference]: Start difference. First operand 6183 states and 17414 transitions. Second operand 3 states. [2019-12-18 14:22:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:25,787 INFO L93 Difference]: Finished difference Result 6183 states and 17413 transitions. [2019-12-18 14:22:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:25,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:22:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:25,797 INFO L225 Difference]: With dead ends: 6183 [2019-12-18 14:22:25,797 INFO L226 Difference]: Without dead ends: 6183 [2019-12-18 14:22:25,797 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 14:22:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2019-12-18 14:22:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 3992. [2019-12-18 14:22:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2019-12-18 14:22:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 11384 transitions. [2019-12-18 14:22:25,866 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 11384 transitions. Word has length 66 [2019-12-18 14:22:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:25,866 INFO L462 AbstractCegarLoop]: Abstraction has 3992 states and 11384 transitions. [2019-12-18 14:22:25,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 11384 transitions. [2019-12-18 14:22:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:25,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:25,871 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 14:22:25,872 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 14:22:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 486159966, now seen corresponding path program 1 times [2019-12-18 14:22:25,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:25,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758772956] [2019-12-18 14:22:25,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:25,998 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 14:22:25,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758772956] [2019-12-18 14:22:25,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:25,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:22:25,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126921839] [2019-12-18 14:22:25,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:22:25,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:22:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:22:26,000 INFO L87 Difference]: Start difference. First operand 3992 states and 11384 transitions. Second operand 7 states. [2019-12-18 14:22:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:26,118 INFO L93 Difference]: Finished difference Result 6655 states and 19028 transitions. [2019-12-18 14:22:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:22:26,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 14:22:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:26,124 INFO L225 Difference]: With dead ends: 6655 [2019-12-18 14:22:26,125 INFO L226 Difference]: Without dead ends: 3592 [2019-12-18 14:22:26,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:22:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2019-12-18 14:22:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3154. [2019-12-18 14:22:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3154 states. [2019-12-18 14:22:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 8949 transitions. [2019-12-18 14:22:26,194 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 8949 transitions. Word has length 67 [2019-12-18 14:22:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:26,195 INFO L462 AbstractCegarLoop]: Abstraction has 3154 states and 8949 transitions. [2019-12-18 14:22:26,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:22:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 8949 transitions. [2019-12-18 14:22:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:26,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:26,202 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 14:22:26,202 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 14:22:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1374987048, now seen corresponding path program 2 times [2019-12-18 14:22:26,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:26,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487150388] [2019-12-18 14:22:26,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:26,306 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 14:22:26,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487150388] [2019-12-18 14:22:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:26,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:22:26,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237718212] [2019-12-18 14:22:26,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:22:26,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:22:26,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:22:26,308 INFO L87 Difference]: Start difference. First operand 3154 states and 8949 transitions. Second operand 6 states. [2019-12-18 14:22:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:26,383 INFO L93 Difference]: Finished difference Result 5632 states and 16003 transitions. [2019-12-18 14:22:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:22:26,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 14:22:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:26,388 INFO L225 Difference]: With dead ends: 5632 [2019-12-18 14:22:26,388 INFO L226 Difference]: Without dead ends: 2665 [2019-12-18 14:22:26,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:22:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2019-12-18 14:22:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2665. [2019-12-18 14:22:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-12-18 14:22:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 7580 transitions. [2019-12-18 14:22:26,444 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 7580 transitions. Word has length 67 [2019-12-18 14:22:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:26,444 INFO L462 AbstractCegarLoop]: Abstraction has 2665 states and 7580 transitions. [2019-12-18 14:22:26,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:22:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 7580 transitions. [2019-12-18 14:22:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:26,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:26,450 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 14:22:26,451 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 14:22:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -247337982, now seen corresponding path program 3 times [2019-12-18 14:22:26,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:26,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011337912] [2019-12-18 14:22:26,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:26,585 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 14:22:26,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011337912] [2019-12-18 14:22:26,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:26,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:22:26,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886174432] [2019-12-18 14:22:26,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:22:26,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:22:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:22:26,587 INFO L87 Difference]: Start difference. First operand 2665 states and 7580 transitions. Second operand 8 states. [2019-12-18 14:22:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:27,144 INFO L93 Difference]: Finished difference Result 4238 states and 11869 transitions. [2019-12-18 14:22:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:22:27,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 14:22:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:27,151 INFO L225 Difference]: With dead ends: 4238 [2019-12-18 14:22:27,152 INFO L226 Difference]: Without dead ends: 4238 [2019-12-18 14:22:27,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:22:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2019-12-18 14:22:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 2702. [2019-12-18 14:22:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-18 14:22:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 7687 transitions. [2019-12-18 14:22:27,221 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 7687 transitions. Word has length 67 [2019-12-18 14:22:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:27,221 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 7687 transitions. [2019-12-18 14:22:27,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:22:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 7687 transitions. [2019-12-18 14:22:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:22:27,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:27,227 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 14:22:27,227 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2047410026, now seen corresponding path program 4 times [2019-12-18 14:22:27,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:27,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548559998] [2019-12-18 14:22:27,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:22:27,302 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 14:22:27,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548559998] [2019-12-18 14:22:27,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:22:27,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:22:27,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340289483] [2019-12-18 14:22:27,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:22:27,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:22:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:22:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:22:27,308 INFO L87 Difference]: Start difference. First operand 2702 states and 7687 transitions. Second operand 3 states. [2019-12-18 14:22:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:22:27,326 INFO L93 Difference]: Finished difference Result 2404 states and 6694 transitions. [2019-12-18 14:22:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:22:27,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:22:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:22:27,329 INFO L225 Difference]: With dead ends: 2404 [2019-12-18 14:22:27,330 INFO L226 Difference]: Without dead ends: 2404 [2019-12-18 14:22:27,331 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 14:22:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2019-12-18 14:22:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2152. [2019-12-18 14:22:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-18 14:22:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 6002 transitions. [2019-12-18 14:22:27,376 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 6002 transitions. Word has length 67 [2019-12-18 14:22:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:22:27,376 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 6002 transitions. [2019-12-18 14:22:27,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:22:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 6002 transitions. [2019-12-18 14:22:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:22:27,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:22:27,384 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 14:22:27,384 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:22:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:22:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 1 times [2019-12-18 14:22:27,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:22:27,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000671742] [2019-12-18 14:22:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:22:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:22:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:22:27,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:22:27,543 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:22:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1810~0.base_20| 1)) (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1810~0.base_20| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1810~0.base_20|) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= |v_ULTIMATE.start_main_~#t1810~0.offset_17| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1810~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1810~0.base_20|) |v_ULTIMATE.start_main_~#t1810~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1810~0.base_20|) 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t1810~0.offset=|v_ULTIMATE.start_main_~#t1810~0.offset_17|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_~#t1811~0.base=|v_ULTIMATE.start_main_~#t1811~0.base_21|, 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_~#t1810~0.base=|v_ULTIMATE.start_main_~#t1810~0.base_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, 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_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ULTIMATE.start_main_~#t1812~0.base=|v_ULTIMATE.start_main_~#t1812~0.base_20|, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1811~0.offset=|v_ULTIMATE.start_main_~#t1811~0.offset_17|, 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_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t1812~0.offset=|v_ULTIMATE.start_main_~#t1812~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~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_~#t1810~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~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_~#t1811~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1810~0.base, 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_~#t1812~0.base, ~y~0, ULTIMATE.start_main_~#t1811~0.offset, 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_~#t1812~0.offset, #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_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:22:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1811~0.base_11| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1811~0.base_11| 1) |v_#valid_31|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1811~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1811~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1811~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1811~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1811~0.base_11|) |v_ULTIMATE.start_main_~#t1811~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1811~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1811~0.base=|v_ULTIMATE.start_main_~#t1811~0.base_11|, ULTIMATE.start_main_~#t1811~0.offset=|v_ULTIMATE.start_main_~#t1811~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1811~0.base, ULTIMATE.start_main_~#t1811~0.offset] because there is no mapped edge [2019-12-18 14:22:27,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1812~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1812~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1812~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1812~0.base_9|) |v_ULTIMATE.start_main_~#t1812~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1812~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1812~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1812~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1812~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1812~0.base=|v_ULTIMATE.start_main_~#t1812~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1812~0.offset=|v_ULTIMATE.start_main_~#t1812~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1812~0.base, #length, ULTIMATE.start_main_~#t1812~0.offset] because there is no mapped edge [2019-12-18 14:22:27,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} 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 14:22:27,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-554051298 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-554051298 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-554051298 |P2Thread1of1ForFork2_#t~ite15_Out-554051298|)) (and (= ~x$w_buff1~0_In-554051298 |P2Thread1of1ForFork2_#t~ite15_Out-554051298|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-554051298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-554051298, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-554051298, ~x~0=~x~0_In-554051298} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-554051298|, ~x$w_buff1~0=~x$w_buff1~0_In-554051298, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-554051298, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-554051298, ~x~0=~x~0_In-554051298} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:22:27,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |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_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 14:22:27,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-572810898 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-572810898 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-572810898| ~x$w_buff0_used~0_In-572810898) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-572810898| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-572810898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-572810898} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-572810898, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-572810898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-572810898} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:22:27,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1991367270 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1991367270 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1991367270 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1991367270 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out1991367270| ~x$w_buff1_used~0_In1991367270) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1991367270| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1991367270, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1991367270, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1991367270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1991367270} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1991367270, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1991367270, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1991367270, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1991367270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1991367270} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:22:27,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out1405627768| |P0Thread1of1ForFork0_#t~ite4_Out1405627768|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1405627768 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1405627768 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out1405627768| ~x$w_buff1~0_In1405627768)) (and .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out1405627768| ~x~0_In1405627768) (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1405627768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1405627768, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1405627768, ~x~0=~x~0_In1405627768} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1405627768|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1405627768|, ~x$w_buff1~0=~x$w_buff1~0_In1405627768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1405627768, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1405627768, ~x~0=~x~0_In1405627768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:22:27,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1633296720 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1633296720 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1633296720|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1633296720 |P0Thread1of1ForFork0_#t~ite5_Out-1633296720|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1633296720, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1633296720} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1633296720|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1633296720, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1633296720} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:22:27,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1263982031 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1263982031 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1263982031 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1263982031 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1263982031| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1263982031| ~x$w_buff1_used~0_In-1263982031) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1263982031, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1263982031, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1263982031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263982031} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1263982031|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1263982031, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1263982031, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1263982031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263982031} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:22:27,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1880181998 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1880181998 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1880181998 |P2Thread1of1ForFork2_#t~ite19_Out-1880181998|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-1880181998| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1880181998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880181998} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1880181998, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1880181998|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880181998} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:22:27,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-628245718 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-628245718 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-628245718 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-628245718 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-628245718| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite20_Out-628245718| ~x$r_buff1_thd3~0_In-628245718) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-628245718, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-628245718, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-628245718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628245718} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-628245718|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-628245718, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-628245718, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-628245718, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628245718} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:22:27,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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 14:22:27,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1683783855 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1683783855 256)))) (or (and (= ~x$r_buff0_thd1~0_In1683783855 |P0Thread1of1ForFork0_#t~ite7_Out1683783855|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1683783855|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1683783855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1683783855} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1683783855, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1683783855|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1683783855} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:22:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1667916746 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1667916746 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1667916746 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1667916746 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1667916746|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd1~0_In1667916746 |P0Thread1of1ForFork0_#t~ite8_Out1667916746|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1667916746, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667916746, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1667916746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667916746} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1667916746, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1667916746|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667916746, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1667916746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667916746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:22:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} 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 14:22:27,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1182735571 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1182735571 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1182735571| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1182735571| ~x$w_buff0_used~0_In-1182735571) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182735571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182735571} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1182735571|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1182735571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182735571} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:22:27,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In122225204 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In122225204 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In122225204 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In122225204 256) 0))) (or (and (= ~x$w_buff1_used~0_In122225204 |P1Thread1of1ForFork1_#t~ite12_Out122225204|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out122225204| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In122225204, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In122225204, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In122225204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In122225204} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In122225204, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In122225204, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out122225204|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In122225204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In122225204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:22:27,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1471490780 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1471490780 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1471490780 ~x$r_buff0_thd2~0_Out1471490780) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1471490780 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1471490780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471490780} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1471490780|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1471490780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471490780} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:22:27,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1578931593 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1578931593 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1578931593 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1578931593 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out1578931593| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out1578931593| ~x$r_buff1_thd2~0_In1578931593) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1578931593, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1578931593, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1578931593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1578931593} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1578931593, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1578931593, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1578931593, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1578931593|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1578931593} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:22:27,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, 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_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, 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 14:22:27,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~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 14:22:27,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-582260872 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-582260872 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out-582260872| |ULTIMATE.start_main_#t~ite25_Out-582260872|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out-582260872| ~x$w_buff1~0_In-582260872) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~x~0_In-582260872 |ULTIMATE.start_main_#t~ite24_Out-582260872|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-582260872, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582260872, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582260872, ~x~0=~x~0_In-582260872} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-582260872, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-582260872|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-582260872|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582260872, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582260872, ~x~0=~x~0_In-582260872} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:22:27,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1578711956 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1578711956 256)))) (or (and (= ~x$w_buff0_used~0_In1578711956 |ULTIMATE.start_main_#t~ite26_Out1578711956|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1578711956|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1578711956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1578711956} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1578711956, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1578711956|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1578711956} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:22:27,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In163012963 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In163012963 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In163012963 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In163012963 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out163012963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out163012963| ~x$w_buff1_used~0_In163012963)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163012963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163012963, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In163012963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163012963} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In163012963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163012963, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out163012963|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In163012963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163012963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:22:27,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1387717711 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1387717711 256)))) (or (and (= ~x$r_buff0_thd0~0_In1387717711 |ULTIMATE.start_main_#t~ite28_Out1387717711|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out1387717711|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1387717711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1387717711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1387717711, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1387717711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1387717711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:22:27,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In174277612 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In174277612 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In174277612 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In174277612 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out174277612| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In174277612 |ULTIMATE.start_main_#t~ite29_Out174277612|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In174277612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In174277612, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In174277612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174277612} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In174277612, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out174277612|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In174277612, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In174277612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174277612} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:22:27,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~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 14:22:27,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:22:27,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:22:27,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:22:27 BasicIcfg [2019-12-18 14:22:27,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:22:27,691 INFO L168 Benchmark]: Toolchain (without parser) took 86387.45 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,691 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.97 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.99 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,693 INFO L168 Benchmark]: Boogie Preprocessor took 48.95 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,694 INFO L168 Benchmark]: RCFGBuilder took 867.65 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 100.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,694 INFO L168 Benchmark]: TraceAbstraction took 84637.56 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 14:22:27,698 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.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.97 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.99 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.95 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.65 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 100.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84637.56 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1810, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1811, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1812, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L733] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 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) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L826] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L826] 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) [L827] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L827] 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)) [L828] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L828] 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)) [L829] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L829] 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)) [L830] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L830] 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)) [L832] 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_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 84.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2468 SDtfs, 1862 SDslu, 4064 SDs, 0 SdLazy, 2391 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred 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: 39.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 73071 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 832 ConstructedInterpolants, 0 QuantifiedInterpolants, 124344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...