/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/safe022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:59:01,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:59:01,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:59:01,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:59:01,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:59:01,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:59:01,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:59:01,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:59:01,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:59:01,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:59:01,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:59:01,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:59:01,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:59:01,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:59:01,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:59:01,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:59:01,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:59:01,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:59:01,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:59:01,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:59:01,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:59:01,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:59:01,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:59:01,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:59:01,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:59:01,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:59:01,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:59:01,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:59:01,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:59:01,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:59:01,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:59:01,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:59:01,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:59:01,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:59:01,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:59:01,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:59:01,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:59:01,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:59:01,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:59:01,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:59:01,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:59:01,969 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-26 23:59:01,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:59:01,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:59:01,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:59:01,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:59:01,988 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:59:01,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:59:01,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:59:01,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:59:01,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:59:01,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:59:01,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:59:01,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:59:01,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:59:01,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:59:01,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:59:01,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:59:01,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:59:01,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:59:01,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:59:01,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:59:01,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:59:01,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:59:01,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:59:01,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:59:01,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:59:01,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:59:01,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:59:01,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:59:01,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:59:01,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:59:02,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:59:02,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:59:02,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:59:02,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:59:02,321 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:59:02,321 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-26 23:59:02,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c98fca9/4dc72ce3c88649d38a3b943d4f762071/FLAGbf9a196dc [2019-12-26 23:59:03,028 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:59:03,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-26 23:59:03,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c98fca9/4dc72ce3c88649d38a3b943d4f762071/FLAGbf9a196dc [2019-12-26 23:59:03,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c98fca9/4dc72ce3c88649d38a3b943d4f762071 [2019-12-26 23:59:03,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:59:03,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:59:03,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:59:03,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:59:03,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:59:03,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:59:03" (1/1) ... [2019-12-26 23:59:03,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc34d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:03, skipping insertion in model container [2019-12-26 23:59:03,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:59:03" (1/1) ... [2019-12-26 23:59:03,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:59:03,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:59:03,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:59:03,950 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:59:04,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:59:04,114 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:59:04,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04 WrapperNode [2019-12-26 23:59:04,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:59:04,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:59:04,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:59:04,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:59:04,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:59:04,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:59:04,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:59:04,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:59:04,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (1/1) ... [2019-12-26 23:59:04,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:59:04,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:59:04,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:59:04,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:59:04,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (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-26 23:59:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:59:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:59:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:59:04,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:59:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:59:04,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:59:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:59:04,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:59:04,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:59:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:59:04,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:59:04,315 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:59:05,004 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:59:05,004 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:59:05,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:59:05 BoogieIcfgContainer [2019-12-26 23:59:05,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:59:05,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:59:05,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:59:05,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:59:05,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:59:03" (1/3) ... [2019-12-26 23:59:05,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13208cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:59:05, skipping insertion in model container [2019-12-26 23:59:05,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:59:04" (2/3) ... [2019-12-26 23:59:05,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13208cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:59:05, skipping insertion in model container [2019-12-26 23:59:05,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:59:05" (3/3) ... [2019-12-26 23:59:05,020 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-26 23:59:05,032 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:59:05,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:59:05,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:59:05,045 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:59:05,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:59:05,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:59:05,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:59:05,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:59:05,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:59:05,236 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:59:05,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:59:05,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:59:05,236 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:59:05,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:59:05,252 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:59:05,254 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:59:05,338 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:59:05,338 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:59:05,351 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:59:05,371 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:59:05,427 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:59:05,428 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:59:05,436 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:59:05,456 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:59:05,458 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:59:10,331 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:59:10,491 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-26 23:59:10,491 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-26 23:59:10,495 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 23:59:11,060 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-26 23:59:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-26 23:59:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:59:11,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:11,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:59:11,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-26 23:59:11,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:11,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788445758] [2019-12-26 23:59:11,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:11,390 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-26 23:59:11,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788445758] [2019-12-26 23:59:11,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:11,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:59:11,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258529204] [2019-12-26 23:59:11,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:59:11,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:59:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:59:11,420 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-26 23:59:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:11,702 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-26 23:59:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:59:11,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:59:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:11,794 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 23:59:11,795 INFO L226 Difference]: Without dead ends: 7606 [2019-12-26 23:59:11,796 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-26 23:59:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-26 23:59:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-26 23:59:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-26 23:59:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-26 23:59:12,250 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-26 23:59:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:12,251 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-26 23:59:12,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:59:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-26 23:59:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:59:12,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:12,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:59:12,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-26 23:59:12,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:12,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129329947] [2019-12-26 23:59:12,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:12,348 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-26 23:59:12,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129329947] [2019-12-26 23:59:12,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:12,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:59:12,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743442903] [2019-12-26 23:59:12,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:59:12,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:59:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:59:12,356 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-26 23:59:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:12,750 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-26 23:59:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:59:12,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:59:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:12,933 INFO L225 Difference]: With dead ends: 11630 [2019-12-26 23:59:12,933 INFO L226 Difference]: Without dead ends: 11623 [2019-12-26 23:59:12,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-26 23:59:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-26 23:59:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-26 23:59:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-26 23:59:13,321 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-26 23:59:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:13,321 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-26 23:59:13,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:59:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-26 23:59:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:59:13,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:13,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:59:13,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-26 23:59:13,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:13,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463848991] [2019-12-26 23:59:13,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:13,424 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-26 23:59:13,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463848991] [2019-12-26 23:59:13,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:13,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:59:13,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389709089] [2019-12-26 23:59:13,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:59:13,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:59:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:13,426 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-26 23:59:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:13,793 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-26 23:59:13,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:59:13,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:59:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:13,843 INFO L225 Difference]: With dead ends: 14471 [2019-12-26 23:59:13,843 INFO L226 Difference]: Without dead ends: 14471 [2019-12-26 23:59:13,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:59:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-26 23:59:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-26 23:59:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-26 23:59:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-26 23:59:14,809 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-26 23:59:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:14,810 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-26 23:59:14,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:59:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-26 23:59:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:59:14,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:14,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:59:14,815 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-26 23:59:14,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:14,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636519913] [2019-12-26 23:59:14,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:14,862 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-26 23:59:14,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636519913] [2019-12-26 23:59:14,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:14,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:59:14,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436614580] [2019-12-26 23:59:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:59:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:59:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:59:14,864 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-26 23:59:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:14,917 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-26 23:59:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:59:14,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:59:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:14,956 INFO L225 Difference]: With dead ends: 11335 [2019-12-26 23:59:14,957 INFO L226 Difference]: Without dead ends: 11335 [2019-12-26 23:59:14,957 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-26 23:59:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-26 23:59:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-26 23:59:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-26 23:59:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-26 23:59:15,409 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-26 23:59:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:15,410 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-26 23:59:15,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:59:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-26 23:59:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:59:15,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:15,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:59:15,415 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-26 23:59:15,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:15,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065701073] [2019-12-26 23:59:15,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:59:15,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065701073] [2019-12-26 23:59:15,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:15,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:59:15,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100197369] [2019-12-26 23:59:15,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:59:15,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:59:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:59:15,473 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-26 23:59:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:15,555 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-26 23:59:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:59:15,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 23:59:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:15,580 INFO L225 Difference]: With dead ends: 18566 [2019-12-26 23:59:15,580 INFO L226 Difference]: Without dead ends: 9176 [2019-12-26 23:59:15,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-26 23:59:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-26 23:59:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-26 23:59:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-26 23:59:15,830 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-26 23:59:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:15,830 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-26 23:59:15,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:59:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-26 23:59:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:59:15,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:15,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:59:15,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-26 23:59:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355329855] [2019-12-26 23:59:15,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:15,894 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-26 23:59:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355329855] [2019-12-26 23:59:15,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:15,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:59:15,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726408845] [2019-12-26 23:59:15,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:59:15,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:59:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:59:15,896 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 3 states. [2019-12-26 23:59:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:15,950 INFO L93 Difference]: Finished difference Result 8732 states and 26564 transitions. [2019-12-26 23:59:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:59:15,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:59:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:15,971 INFO L225 Difference]: With dead ends: 8732 [2019-12-26 23:59:15,971 INFO L226 Difference]: Without dead ends: 8732 [2019-12-26 23:59:15,971 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-26 23:59:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2019-12-26 23:59:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 8732. [2019-12-26 23:59:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2019-12-26 23:59:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 26564 transitions. [2019-12-26 23:59:16,318 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 26564 transitions. Word has length 18 [2019-12-26 23:59:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 8732 states and 26564 transitions. [2019-12-26 23:59:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:59:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 26564 transitions. [2019-12-26 23:59:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:59:16,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:16,322 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-26 23:59:16,323 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-26 23:59:16,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:16,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63773763] [2019-12-26 23:59:16,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:16,388 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-26 23:59:16,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63773763] [2019-12-26 23:59:16,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:16,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:59:16,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71072485] [2019-12-26 23:59:16,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:59:16,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:59:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:59:16,391 INFO L87 Difference]: Start difference. First operand 8732 states and 26564 transitions. Second operand 4 states. [2019-12-26 23:59:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:16,423 INFO L93 Difference]: Finished difference Result 1587 states and 3865 transitions. [2019-12-26 23:59:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:59:16,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:59:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:16,426 INFO L225 Difference]: With dead ends: 1587 [2019-12-26 23:59:16,426 INFO L226 Difference]: Without dead ends: 1155 [2019-12-26 23:59:16,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-26 23:59:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2019-12-26 23:59:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-12-26 23:59:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2511 transitions. [2019-12-26 23:59:16,458 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2511 transitions. Word has length 19 [2019-12-26 23:59:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:16,459 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 2511 transitions. [2019-12-26 23:59:16,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:59:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2511 transitions. [2019-12-26 23:59:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 23:59:16,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:16,461 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] [2019-12-26 23:59:16,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-26 23:59:16,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:16,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504523552] [2019-12-26 23:59:16,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:16,565 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-26 23:59:16,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504523552] [2019-12-26 23:59:16,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:16,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:59:16,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284289866] [2019-12-26 23:59:16,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:59:16,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:59:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:59:16,568 INFO L87 Difference]: Start difference. First operand 1155 states and 2511 transitions. Second operand 6 states. [2019-12-26 23:59:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:16,790 INFO L93 Difference]: Finished difference Result 1173 states and 2521 transitions. [2019-12-26 23:59:16,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:59:16,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 23:59:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:16,793 INFO L225 Difference]: With dead ends: 1173 [2019-12-26 23:59:16,793 INFO L226 Difference]: Without dead ends: 1121 [2019-12-26 23:59:16,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:59:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-26 23:59:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1100. [2019-12-26 23:59:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-12-26 23:59:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2394 transitions. [2019-12-26 23:59:16,822 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2394 transitions. Word has length 24 [2019-12-26 23:59:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:16,822 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 2394 transitions. [2019-12-26 23:59:16,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:59:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2394 transitions. [2019-12-26 23:59:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:59:16,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:16,826 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] [2019-12-26 23:59:16,826 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-26 23:59:16,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:16,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998335488] [2019-12-26 23:59:16,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:16,920 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-26 23:59:16,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998335488] [2019-12-26 23:59:16,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:16,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:59:16,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362739343] [2019-12-26 23:59:16,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:59:16,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:59:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:16,926 INFO L87 Difference]: Start difference. First operand 1100 states and 2394 transitions. Second operand 5 states. [2019-12-26 23:59:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:16,971 INFO L93 Difference]: Finished difference Result 556 states and 1184 transitions. [2019-12-26 23:59:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:59:16,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:59:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:16,973 INFO L225 Difference]: With dead ends: 556 [2019-12-26 23:59:16,973 INFO L226 Difference]: Without dead ends: 471 [2019-12-26 23:59:16,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:59:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-26 23:59:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-26 23:59:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-26 23:59:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-26 23:59:16,982 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 28 [2019-12-26 23:59:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:16,983 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-26 23:59:16,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:59:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-26 23:59:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:59:16,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:16,985 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] [2019-12-26 23:59:16,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 1 times [2019-12-26 23:59:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184585370] [2019-12-26 23:59:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:17,081 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-26 23:59:17,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184585370] [2019-12-26 23:59:17,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:17,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:59:17,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948507940] [2019-12-26 23:59:17,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:59:17,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:17,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:59:17,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:59:17,084 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-26 23:59:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:17,265 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-26 23:59:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:59:17,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:59:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:17,267 INFO L225 Difference]: With dead ends: 982 [2019-12-26 23:59:17,267 INFO L226 Difference]: Without dead ends: 683 [2019-12-26 23:59:17,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:59:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-26 23:59:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-26 23:59:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-26 23:59:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-26 23:59:17,285 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-26 23:59:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:17,285 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-26 23:59:17,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:59:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-26 23:59:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:59:17,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:17,291 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] [2019-12-26 23:59:17,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 2 times [2019-12-26 23:59:17,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:17,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65678086] [2019-12-26 23:59:17,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:17,417 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-26 23:59:17,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65678086] [2019-12-26 23:59:17,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:17,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:59:17,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434172855] [2019-12-26 23:59:17,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:59:17,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:59:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:59:17,420 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-26 23:59:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:17,833 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-26 23:59:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:59:17,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 23:59:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:17,835 INFO L225 Difference]: With dead ends: 885 [2019-12-26 23:59:17,835 INFO L226 Difference]: Without dead ends: 861 [2019-12-26 23:59:17,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:59:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-26 23:59:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-26 23:59:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-26 23:59:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-26 23:59:17,850 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-26 23:59:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:17,850 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-26 23:59:17,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:59:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-26 23:59:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:59:17,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:17,853 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] [2019-12-26 23:59:17,853 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 3 times [2019-12-26 23:59:17,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:17,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374992140] [2019-12-26 23:59:17,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:59:17,928 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-26 23:59:17,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374992140] [2019-12-26 23:59:17,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:59:17,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:59:17,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914618396] [2019-12-26 23:59:17,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:59:17,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:59:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:59:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:59:17,931 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-26 23:59:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:59:17,978 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-26 23:59:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:59:17,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:59:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:59:17,982 INFO L225 Difference]: With dead ends: 923 [2019-12-26 23:59:17,982 INFO L226 Difference]: Without dead ends: 923 [2019-12-26 23:59:17,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:59:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-26 23:59:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-26 23:59:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-26 23:59:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-26 23:59:17,995 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-26 23:59:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:59:17,995 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-26 23:59:17,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:59:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-26 23:59:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:59:17,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:59:17,998 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] [2019-12-26 23:59:17,998 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:59:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:59:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-26 23:59:17,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:59:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872633784] [2019-12-26 23:59:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:59:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:59:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:59:18,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:59:18,177 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:59:18,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| 4)) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48|) |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_48|) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48|) 0) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48| 1)) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_49|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_48|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:59:18,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-26 23:59:18,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~x~0_Out-369683435) (= ~y$r_buff1_thd0~0_Out-369683435 ~y$r_buff0_thd0~0_In-369683435) (= ~y$r_buff0_thd2~0_In-369683435 ~y$r_buff1_thd2~0_Out-369683435) (= 1 ~y$r_buff0_thd1~0_Out-369683435) (= ~y$r_buff0_thd1~0_In-369683435 ~y$r_buff1_thd1~0_Out-369683435) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-369683435))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-369683435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-369683435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-369683435, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-369683435} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-369683435, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-369683435, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-369683435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-369683435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-369683435, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-369683435, ~x~0=~x~0_Out-369683435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-369683435} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:59:18,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2094022049 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2094022049 256)))) (or (and (= ~y$w_buff0_used~0_In-2094022049 |P0Thread1of1ForFork0_#t~ite5_Out-2094022049|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2094022049|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094022049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2094022049} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2094022049|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094022049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2094022049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:59:18,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-830517262 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-830517262| ~y$w_buff0_used~0_In-830517262) (= |P1Thread1of1ForFork1_#t~ite20_In-830517262| |P1Thread1of1ForFork1_#t~ite20_Out-830517262|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-830517262| |P1Thread1of1ForFork1_#t~ite21_Out-830517262|) (= |P1Thread1of1ForFork1_#t~ite20_Out-830517262| ~y$w_buff0_used~0_In-830517262) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-830517262 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-830517262 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-830517262 256) 0) (and (= (mod ~y$w_buff1_used~0_In-830517262 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-830517262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-830517262, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-830517262|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-830517262, ~weak$$choice2~0=~weak$$choice2~0_In-830517262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-830517262} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-830517262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-830517262, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-830517262|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-830517262, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-830517262|, ~weak$$choice2~0=~weak$$choice2~0_In-830517262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-830517262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:59:18,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out-1330456130| |P1Thread1of1ForFork1_#t~ite23_Out-1330456130|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1330456130 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1330456130 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-1330456130 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-1330456130 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1330456130 256)))) (or (let ((.cse2 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1330456130| 0) (= |P1Thread1of1ForFork1_#t~ite22_Out-1330456130| |P1Thread1of1ForFork1_#t~ite23_Out-1330456130|) (not .cse0) (or (not .cse1) .cse2) .cse3 (or (not .cse4) .cse2) .cse5)) (and (or (and (= ~y$w_buff1_used~0_In-1330456130 |P1Thread1of1ForFork1_#t~ite23_Out-1330456130|) .cse3 (or (and .cse6 .cse1) .cse0 (and .cse6 .cse4)) .cse5) (and (= ~y$w_buff1_used~0_In-1330456130 |P1Thread1of1ForFork1_#t~ite24_Out-1330456130|) (= |P1Thread1of1ForFork1_#t~ite23_In-1330456130| |P1Thread1of1ForFork1_#t~ite23_Out-1330456130|) (not .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In-1330456130| |P1Thread1of1ForFork1_#t~ite22_Out-1330456130|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1330456130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1330456130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1330456130, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1330456130|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1330456130|, ~weak$$choice2~0=~weak$$choice2~0_In-1330456130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1330456130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1330456130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1330456130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1330456130, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1330456130|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1330456130|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1330456130|, ~weak$$choice2~0=~weak$$choice2~0_In-1330456130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1330456130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 23:59:18,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1117962337 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1117962337 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1117962337 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1117962337 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1117962337| ~y$w_buff1_used~0_In-1117962337)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1117962337|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1117962337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117962337, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1117962337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117962337} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1117962337|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1117962337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117962337, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1117962337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117962337} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:59:18,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1213450504 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1213450504 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-1213450504 ~y$r_buff0_thd1~0_Out-1213450504) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd1~0_Out-1213450504) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1213450504, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1213450504} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1213450504, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1213450504|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1213450504} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:59:18,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In32946045 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In32946045 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In32946045 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In32946045 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out32946045| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out32946045| ~y$r_buff1_thd1~0_In32946045) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In32946045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In32946045, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In32946045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In32946045} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In32946045, ~y$w_buff0_used~0=~y$w_buff0_used~0_In32946045, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out32946045|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In32946045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In32946045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:59:18,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:59:18,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1738006688 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1738006688 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1738006688 256)) (and (= (mod ~y$w_buff1_used~0_In-1738006688 256) 0) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-1738006688 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-1738006688| |P1Thread1of1ForFork1_#t~ite30_Out-1738006688|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1738006688| ~y$r_buff1_thd2~0_In-1738006688)) (and (= ~y$r_buff1_thd2~0_In-1738006688 |P1Thread1of1ForFork1_#t~ite30_Out-1738006688|) (= |P1Thread1of1ForFork1_#t~ite29_In-1738006688| |P1Thread1of1ForFork1_#t~ite29_Out-1738006688|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1738006688, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1738006688|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738006688, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1738006688, ~weak$$choice2~0=~weak$$choice2~0_In-1738006688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1738006688} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1738006688, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1738006688|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1738006688|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738006688, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1738006688, ~weak$$choice2~0=~weak$$choice2~0_In-1738006688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1738006688} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:59:18,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 23:59:18,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In723445990 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In723445990 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In723445990 |P1Thread1of1ForFork1_#t~ite32_Out723445990|)) (and (= ~y~0_In723445990 |P1Thread1of1ForFork1_#t~ite32_Out723445990|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In723445990, ~y$w_buff1~0=~y$w_buff1~0_In723445990, ~y~0=~y~0_In723445990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723445990} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In723445990, ~y$w_buff1~0=~y$w_buff1~0_In723445990, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out723445990|, ~y~0=~y~0_In723445990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In723445990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:59:18,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 23:59:18,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1119245028 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1119245028 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1119245028| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1119245028| ~y$w_buff0_used~0_In-1119245028)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119245028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1119245028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119245028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1119245028, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1119245028|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:59:18,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2123719659 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2123719659 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In2123719659 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2123719659 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2123719659 |P1Thread1of1ForFork1_#t~ite35_Out2123719659|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2123719659|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2123719659, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2123719659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2123719659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2123719659} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2123719659, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2123719659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2123719659, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2123719659|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2123719659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:59:18,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-903792134 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-903792134 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-903792134| ~y$r_buff0_thd2~0_In-903792134) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-903792134| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-903792134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903792134} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-903792134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903792134, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-903792134|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:59:18,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2079060819 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2079060819 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2079060819 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-2079060819 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2079060819| 0)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-2079060819 |P1Thread1of1ForFork1_#t~ite37_Out-2079060819|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2079060819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079060819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2079060819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079060819} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2079060819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079060819, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2079060819, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2079060819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079060819} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:59:18,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:59:18,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:59:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:59:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In992648827 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In992648827 256) 0))) (or (and (= ~y~0_In992648827 |ULTIMATE.start_main_#t~ite40_Out992648827|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In992648827 |ULTIMATE.start_main_#t~ite40_Out992648827|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In992648827, ~y~0=~y~0_In992648827, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In992648827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In992648827} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out992648827|, ~y$w_buff1~0=~y$w_buff1~0_In992648827, ~y~0=~y~0_In992648827, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In992648827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In992648827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:59:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 23:59:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1486934880 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1486934880 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1486934880|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1486934880 |ULTIMATE.start_main_#t~ite42_Out1486934880|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1486934880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1486934880} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1486934880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1486934880, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1486934880|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:59:18,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In740256286 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In740256286 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In740256286 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In740256286 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In740256286 |ULTIMATE.start_main_#t~ite43_Out740256286|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out740256286|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In740256286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740256286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In740256286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In740256286} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In740256286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In740256286, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out740256286|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In740256286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In740256286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:59:18,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1596110757 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1596110757 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1596110757|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1596110757 |ULTIMATE.start_main_#t~ite44_Out-1596110757|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1596110757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1596110757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1596110757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1596110757, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1596110757|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:59:18,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1941709652 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1941709652 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1941709652 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1941709652 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1941709652|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1941709652| ~y$r_buff1_thd0~0_In-1941709652)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1941709652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1941709652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1941709652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1941709652} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1941709652, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1941709652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1941709652, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1941709652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1941709652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:59:18,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:59:18,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:59:18 BasicIcfg [2019-12-26 23:59:18,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:59:18,370 INFO L168 Benchmark]: Toolchain (without parser) took 15053.97 ms. Allocated memory was 143.1 MB in the beginning and 637.0 MB in the end (delta: 493.9 MB). Free memory was 99.3 MB in the beginning and 490.3 MB in the end (delta: -390.9 MB). Peak memory consumption was 487.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,370 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:59:18,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.3 MB in the beginning and 153.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 199.8 MB. Free memory was 153.9 MB in the beginning and 150.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,373 INFO L168 Benchmark]: Boogie Preprocessor took 35.81 ms. Allocated memory is still 199.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,373 INFO L168 Benchmark]: RCFGBuilder took 787.87 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 105.2 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,375 INFO L168 Benchmark]: TraceAbstraction took 13357.07 ms. Allocated memory was 199.8 MB in the beginning and 637.0 MB in the end (delta: 437.3 MB). Free memory was 104.2 MB in the beginning and 490.3 MB in the end (delta: -386.1 MB). Peak memory consumption was 436.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:59:18,379 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.19 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.3 MB in the beginning and 153.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 199.8 MB. Free memory was 153.9 MB in the beginning and 150.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.81 ms. Allocated memory is still 199.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.87 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 105.2 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13357.07 ms. Allocated memory was 199.8 MB in the beginning and 637.0 MB in the end (delta: 437.3 MB). Free memory was 104.2 MB in the beginning and 490.3 MB in the end (delta: -386.1 MB). Peak memory consumption was 436.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1237 SDtfs, 1416 SDslu, 2185 SDs, 0 SdLazy, 1046 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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: 2.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 4812 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 27785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...