/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/podwr000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:06:17,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:06:17,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:06:18,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:06:18,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:06:18,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:06:18,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:06:18,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:06:18,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:06:18,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:06:18,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:06:18,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:06:18,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:06:18,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:06:18,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:06:18,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:06:18,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:06:18,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:06:18,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:06:18,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:06:18,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:06:18,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:06:18,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:06:18,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:06:18,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:06:18,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:06:18,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:06:18,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:06:18,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:06:18,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:06:18,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:06:18,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:06:18,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:06:18,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:06:18,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:06:18,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:06:18,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:06:18,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:06:18,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:06:18,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:06:18,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:06:18,046 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:06:18,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:06:18,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:06:18,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:06:18,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:06:18,062 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:06:18,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:06:18,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:06:18,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:06:18,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:06:18,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:06:18,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:06:18,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:06:18,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:06:18,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:06:18,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:06:18,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:06:18,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:06:18,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:06:18,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:06:18,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:06:18,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:06:18,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:06:18,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:06:18,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:06:18,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:06:18,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:06:18,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:06:18,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:06:18,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:06:18,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:06:18,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:06:18,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:06:18,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:06:18,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:06:18,355 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:06:18,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_power.opt.i [2019-12-26 23:06:18,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013694274/d402eaff15004e868de3c549d0aabea0/FLAG275a9120c [2019-12-26 23:06:18,941 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:06:18,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_power.opt.i [2019-12-26 23:06:18,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013694274/d402eaff15004e868de3c549d0aabea0/FLAG275a9120c [2019-12-26 23:06:19,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013694274/d402eaff15004e868de3c549d0aabea0 [2019-12-26 23:06:19,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:06:19,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:06:19,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:19,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:06:19,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:06:19,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:19" (1/1) ... [2019-12-26 23:06:19,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b77103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:19, skipping insertion in model container [2019-12-26 23:06:19,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:19" (1/1) ... [2019-12-26 23:06:19,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:06:19,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:06:19,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:19,903 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:06:19,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:20,042 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:06:20,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20 WrapperNode [2019-12-26 23:06:20,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:20,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:20,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:06:20,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:06:20,053 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:06:20" (1/1) ... [2019-12-26 23:06:20,073 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:06:20" (1/1) ... [2019-12-26 23:06:20,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:20,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:06:20,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:06:20,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:06:20,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (1/1) ... [2019-12-26 23:06:20,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:06:20,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:06:20,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:06:20,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:06:20,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (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:06:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:06:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:06:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:06:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:06:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:06:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:06:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:06:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:06:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:06:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:06:20,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:06:20,211 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:06:20,959 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:06:20,960 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:06:20,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:20 BoogieIcfgContainer [2019-12-26 23:06:20,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:06:20,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:06:20,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:06:20,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:06:20,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:06:19" (1/3) ... [2019-12-26 23:06:20,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5854d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:20, skipping insertion in model container [2019-12-26 23:06:20,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:20" (2/3) ... [2019-12-26 23:06:20,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5854d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:20, skipping insertion in model container [2019-12-26 23:06:20,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:20" (3/3) ... [2019-12-26 23:06:20,970 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_power.opt.i [2019-12-26 23:06:20,981 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:06:20,981 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:06:20,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:06:20,990 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:06:21,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:21,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:06:21,147 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:06:21,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:06:21,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:06:21,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:06:21,148 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:06:21,148 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:06:21,148 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:06:21,148 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:06:21,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:06:21,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:06:21,288 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:06:21,288 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:21,301 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:06:21,322 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:06:21,366 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:06:21,366 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:21,372 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:06:21,388 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:06:21,389 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:06:25,949 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:06:26,055 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:06:26,120 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-26 23:06:26,120 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-26 23:06:26,123 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 23:06:26,531 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-26 23:06:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-26 23:06:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:06:26,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:26,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:06:26,541 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:06:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-26 23:06:26,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:26,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967499917] [2019-12-26 23:06:26,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:26,753 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:06:26,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967499917] [2019-12-26 23:06:26,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:26,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:06:26,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337872825] [2019-12-26 23:06:26,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:26,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:26,778 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-26 23:06:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:27,078 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-26 23:06:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:27,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:06:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:27,190 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 23:06:27,190 INFO L226 Difference]: Without dead ends: 7606 [2019-12-26 23:06:27,191 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:06:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-26 23:06:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-26 23:06:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-26 23:06:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-26 23:06:27,664 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-26 23:06:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:27,665 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-26 23:06:27,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-26 23:06:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:06:27,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:27,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:27,675 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:06:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-26 23:06:27,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:27,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347951191] [2019-12-26 23:06:27,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:27,832 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:06:27,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347951191] [2019-12-26 23:06:27,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:27,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:27,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235112822] [2019-12-26 23:06:27,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:27,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:27,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:27,836 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-26 23:06:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:28,237 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-26 23:06:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:28,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:06:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:28,319 INFO L225 Difference]: With dead ends: 11630 [2019-12-26 23:06:28,320 INFO L226 Difference]: Without dead ends: 11623 [2019-12-26 23:06:28,322 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:06:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-26 23:06:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-26 23:06:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-26 23:06:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-26 23:06:29,323 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-26 23:06:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:29,323 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-26 23:06:29,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-26 23:06:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:06:29,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:29,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:29,329 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:06:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-26 23:06:29,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:29,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750754685] [2019-12-26 23:06:29,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:29,449 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:06:29,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750754685] [2019-12-26 23:06:29,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:29,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:29,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183771389] [2019-12-26 23:06:29,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:29,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:29,452 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-26 23:06:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:29,825 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-26 23:06:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:06:29,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:06:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:29,873 INFO L225 Difference]: With dead ends: 14471 [2019-12-26 23:06:29,873 INFO L226 Difference]: Without dead ends: 14471 [2019-12-26 23:06:29,874 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:06:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-26 23:06:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-26 23:06:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-26 23:06:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-26 23:06:30,410 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-26 23:06:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:30,411 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-26 23:06:30,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-26 23:06:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:06:30,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:30,415 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:06:30,416 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:06:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-26 23:06:30,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:30,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055546696] [2019-12-26 23:06:30,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:30,479 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:06:30,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055546696] [2019-12-26 23:06:30,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:30,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:30,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545854496] [2019-12-26 23:06:30,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:30,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:30,481 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-26 23:06:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:30,531 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-26 23:06:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:30,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:06:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:30,555 INFO L225 Difference]: With dead ends: 10750 [2019-12-26 23:06:30,555 INFO L226 Difference]: Without dead ends: 10750 [2019-12-26 23:06:30,555 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:06:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-26 23:06:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-26 23:06:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-26 23:06:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-26 23:06:30,856 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-26 23:06:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:30,856 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-26 23:06:30,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-26 23:06:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:06:30,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:30,860 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:06:30,860 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:06:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-26 23:06:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:30,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706754588] [2019-12-26 23:06:30,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:30,946 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:06:30,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706754588] [2019-12-26 23:06:30,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:30,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:30,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299356886] [2019-12-26 23:06:30,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:30,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:30,949 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-26 23:06:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:30,983 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-26 23:06:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:06:30,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:06:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:30,986 INFO L225 Difference]: With dead ends: 2054 [2019-12-26 23:06:30,986 INFO L226 Difference]: Without dead ends: 1457 [2019-12-26 23:06:30,987 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:06:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-26 23:06:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-26 23:06:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-26 23:06:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-26 23:06:31,011 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-26 23:06:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:31,012 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-26 23:06:31,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-26 23:06:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 23:06:31,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:31,014 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:06:31,014 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:06:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-26 23:06:31,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:31,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5856345] [2019-12-26 23:06:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:31,128 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:06:31,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5856345] [2019-12-26 23:06:31,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:31,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:31,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239500296] [2019-12-26 23:06:31,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:06:31,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:06:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:31,132 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-26 23:06:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:31,579 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-26 23:06:31,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:06:31,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 23:06:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:31,582 INFO L225 Difference]: With dead ends: 2249 [2019-12-26 23:06:31,583 INFO L226 Difference]: Without dead ends: 2197 [2019-12-26 23:06:31,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:06:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-26 23:06:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-26 23:06:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-26 23:06:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-26 23:06:31,612 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-26 23:06:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:31,612 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-26 23:06:31,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:06:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-26 23:06:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:06:31,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:31,615 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] [2019-12-26 23:06:31,616 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:06:31,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:31,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-26 23:06:31,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:31,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705940346] [2019-12-26 23:06:31,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:31,702 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:06:31,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705940346] [2019-12-26 23:06:31,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:31,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:31,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473175044] [2019-12-26 23:06:31,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:31,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:31,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:31,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:31,706 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-26 23:06:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:31,747 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-26 23:06:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:06:31,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:06:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:31,748 INFO L225 Difference]: With dead ends: 752 [2019-12-26 23:06:31,748 INFO L226 Difference]: Without dead ends: 689 [2019-12-26 23:06:31,749 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:06:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-26 23:06:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-26 23:06:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-26 23:06:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-26 23:06:31,759 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-26 23:06:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:31,760 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-26 23:06:31,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-26 23:06:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:06:31,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:31,763 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:06:31,763 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:06:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-26 23:06:31,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:31,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050710649] [2019-12-26 23:06:31,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:31,846 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:06:31,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050710649] [2019-12-26 23:06:31,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:31,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:06:31,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689791911] [2019-12-26 23:06:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:06:31,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:06:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:06:31,848 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-26 23:06:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:31,865 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-26 23:06:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:06:31,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-26 23:06:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:31,867 INFO L225 Difference]: With dead ends: 1118 [2019-12-26 23:06:31,867 INFO L226 Difference]: Without dead ends: 471 [2019-12-26 23:06:31,867 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:06:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-26 23:06:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-26 23:06:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-26 23:06:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-26 23:06:31,876 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-26 23:06:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:31,876 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-26 23:06:31,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:06:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-26 23:06:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:06:31,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:31,879 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:06:31,879 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:06:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-26 23:06:31,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:31,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969805312] [2019-12-26 23:06:31,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:31,982 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:06:31,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969805312] [2019-12-26 23:06:31,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:31,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:06:31,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943623290] [2019-12-26 23:06:31,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:06:31,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:06:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:06:31,985 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-26 23:06:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:32,188 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-26 23:06:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:06:32,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:06:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:32,190 INFO L225 Difference]: With dead ends: 982 [2019-12-26 23:06:32,190 INFO L226 Difference]: Without dead ends: 683 [2019-12-26 23:06:32,191 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:06:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-26 23:06:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-26 23:06:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-26 23:06:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-26 23:06:32,201 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-26 23:06:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:32,201 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-26 23:06:32,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:06:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-26 23:06:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:06:32,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:32,203 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:06:32,204 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:06:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-26 23:06:32,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:32,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079660984] [2019-12-26 23:06:32,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:32,303 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:06:32,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079660984] [2019-12-26 23:06:32,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:32,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:06:32,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318688809] [2019-12-26 23:06:32,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:32,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:32,305 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-26 23:06:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:32,661 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-26 23:06:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:06:32,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-26 23:06:32,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:32,663 INFO L225 Difference]: With dead ends: 885 [2019-12-26 23:06:32,663 INFO L226 Difference]: Without dead ends: 861 [2019-12-26 23:06:32,663 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:06:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-26 23:06:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-26 23:06:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-26 23:06:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-26 23:06:32,676 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-26 23:06:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:32,676 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-26 23:06:32,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-26 23:06:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:06:32,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:32,679 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:06:32,679 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:06:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-26 23:06:32,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:32,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551230130] [2019-12-26 23:06:32,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:32,752 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:06:32,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551230130] [2019-12-26 23:06:32,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:32,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:06:32,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209877755] [2019-12-26 23:06:32,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:06:32,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:06:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:06:32,755 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-26 23:06:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:32,806 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-26 23:06:32,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:06:32,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:06:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:32,808 INFO L225 Difference]: With dead ends: 923 [2019-12-26 23:06:32,809 INFO L226 Difference]: Without dead ends: 923 [2019-12-26 23:06:32,809 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:06:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-26 23:06:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-26 23:06:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-26 23:06:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-26 23:06:32,828 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-26 23:06:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-26 23:06:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:06:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-26 23:06:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:06:32,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:32,831 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:06:32,831 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:06:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-26 23:06:32,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:32,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294994667] [2019-12-26 23:06:32,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:33,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:06:33,002 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:06:33,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1547~0.base_40|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40|) |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| 4)) (= |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40| 1) |v_#valid_65|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #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, ULTIMATE.start_main_~#t1547~0.offset=|v_ULTIMATE.start_main_~#t1547~0.offset_27|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, 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_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_27|, ~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_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1547~0.base=|v_ULTIMATE.start_main_~#t1547~0.base_40|, ~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_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #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_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~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_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~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, ULTIMATE.start_main_~#t1547~0.offset, ULTIMATE.start_main_~#t1548~0.base, #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, ULTIMATE.start_main_~#t1548~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1547~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~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_#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:06:33,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1548~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1548~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13|) |v_ULTIMATE.start_main_~#t1548~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1548~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1548~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:06:33,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-1810548946) (= ~y$r_buff1_thd1~0_Out-1810548946 ~y$r_buff0_thd1~0_In-1810548946) (= ~y$r_buff0_thd2~0_In-1810548946 ~y$r_buff1_thd2~0_Out-1810548946) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1810548946 0)) (= ~y$r_buff1_thd0~0_Out-1810548946 ~y$r_buff0_thd0~0_In-1810548946) (= ~x~0_In-1810548946 ~__unbuffered_p0_EAX~0_Out-1810548946)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1810548946, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1810548946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1810548946, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1810548946, ~x~0=~x~0_In-1810548946} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1810548946, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1810548946, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1810548946, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1810548946, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1810548946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1810548946, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1810548946, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1810548946, ~x~0=~x~0_In-1810548946} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:06:33,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-883927573 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-883927573 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-883927573| ~y$w_buff0_used~0_In-883927573) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-883927573| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-883927573, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-883927573} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-883927573|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-883927573, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-883927573} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:06:33,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1888810740 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1888810740| |P1Thread1of1ForFork1_#t~ite20_Out-1888810740|) (= ~y$w_buff0_used~0_In-1888810740 |P1Thread1of1ForFork1_#t~ite20_Out-1888810740|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1888810740 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-1888810740 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1888810740 256)) (and (= (mod ~y$w_buff1_used~0_In-1888810740 256) 0) .cse0))) .cse1) (and (not .cse1) (= ~y$w_buff0_used~0_In-1888810740 |P1Thread1of1ForFork1_#t~ite21_Out-1888810740|) (= |P1Thread1of1ForFork1_#t~ite20_In-1888810740| |P1Thread1of1ForFork1_#t~ite20_Out-1888810740|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1888810740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1888810740, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1888810740|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1888810740, ~weak$$choice2~0=~weak$$choice2~0_In-1888810740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888810740} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1888810740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1888810740, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1888810740|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1888810740, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1888810740|, ~weak$$choice2~0=~weak$$choice2~0_In-1888810740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888810740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:06:33,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1027988065 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1027988065 256) 0)) (.cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out1027988065| |P1Thread1of1ForFork1_#t~ite24_Out1027988065|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1027988065 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In1027988065 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1027988065 256)))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse3 .cse1)) (= |P1Thread1of1ForFork1_#t~ite23_Out1027988065| ~y$w_buff1_used~0_In1027988065) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1027988065| |P1Thread1of1ForFork1_#t~ite23_In1027988065|) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite24_Out1027988065| ~y$w_buff1_used~0_In1027988065))) (= |P1Thread1of1ForFork1_#t~ite22_In1027988065| |P1Thread1of1ForFork1_#t~ite22_Out1027988065|)) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out1027988065| 0) (or (not .cse3) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out1027988065| |P1Thread1of1ForFork1_#t~ite23_Out1027988065|) (not .cse0) .cse4 (or (not .cse2) .cse6) .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1027988065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1027988065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1027988065, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1027988065|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1027988065|, ~weak$$choice2~0=~weak$$choice2~0_In1027988065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1027988065} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1027988065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1027988065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1027988065, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1027988065|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1027988065|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1027988065|, ~weak$$choice2~0=~weak$$choice2~0_In1027988065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1027988065} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 23:06:33,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1316177934 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1316177934 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1316177934 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1316177934 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1316177934|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1316177934| ~y$w_buff1_used~0_In-1316177934) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1316177934, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1316177934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1316177934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1316177934} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1316177934|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1316177934, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1316177934, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1316177934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1316177934} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:06:33,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1861877640 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1861877640 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-1861877640 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-1861877640 ~y$r_buff0_thd1~0_In-1861877640)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1861877640, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1861877640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1861877640, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1861877640|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1861877640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:06:33,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In260688823 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In260688823 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In260688823 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In260688823 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out260688823| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out260688823| ~y$r_buff1_thd1~0_In260688823) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In260688823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In260688823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In260688823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260688823} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In260688823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In260688823, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out260688823|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In260688823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260688823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:06:33,019 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|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) 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_88} 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_88, 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:06:33,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In45425752 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out45425752| ~y$r_buff1_thd2~0_In45425752) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In45425752 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In45425752 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In45425752 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In45425752 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out45425752| |P1Thread1of1ForFork1_#t~ite30_Out45425752|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In45425752| |P1Thread1of1ForFork1_#t~ite29_Out45425752|) (= |P1Thread1of1ForFork1_#t~ite30_Out45425752| ~y$r_buff1_thd2~0_In45425752) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45425752, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In45425752|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In45425752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In45425752, ~weak$$choice2~0=~weak$$choice2~0_In45425752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45425752} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45425752, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out45425752|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out45425752|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In45425752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In45425752, ~weak$$choice2~0=~weak$$choice2~0_In45425752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45425752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:06:33,021 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:06:33,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1956407706 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1956407706 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1956407706 |P1Thread1of1ForFork1_#t~ite32_Out-1956407706|)) (and (not .cse0) (= ~y$w_buff1~0_In-1956407706 |P1Thread1of1ForFork1_#t~ite32_Out-1956407706|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1956407706, ~y$w_buff1~0=~y$w_buff1~0_In-1956407706, ~y~0=~y~0_In-1956407706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956407706} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1956407706, ~y$w_buff1~0=~y$w_buff1~0_In-1956407706, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1956407706|, ~y~0=~y~0_In-1956407706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956407706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:06:33,021 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:06:33,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2082162731 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2082162731 256)))) (or (and (= ~y$w_buff0_used~0_In-2082162731 |P1Thread1of1ForFork1_#t~ite34_Out-2082162731|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2082162731|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082162731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2082162731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082162731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2082162731, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2082162731|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:06:33,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In712981342 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In712981342 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In712981342 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In712981342 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out712981342|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In712981342 |P1Thread1of1ForFork1_#t~ite35_Out712981342|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In712981342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712981342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712981342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712981342} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In712981342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In712981342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712981342, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out712981342|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712981342} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:06:33,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In104098484 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In104098484 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out104098484| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out104098484| ~y$r_buff0_thd2~0_In104098484)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In104098484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In104098484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In104098484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In104098484, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out104098484|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:06:33,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-114695652 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-114695652 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-114695652 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-114695652 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-114695652|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-114695652| ~y$r_buff1_thd2~0_In-114695652)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-114695652, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-114695652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-114695652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-114695652} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-114695652, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-114695652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-114695652, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-114695652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-114695652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:06:33,025 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:06:33,025 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:06:33,026 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:06:33,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1194119694 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1194119694 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1194119694| ~y$w_buff1~0_In1194119694)) (and (= |ULTIMATE.start_main_#t~ite40_Out1194119694| ~y~0_In1194119694) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1194119694, ~y~0=~y~0_In1194119694, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194119694, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194119694} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1194119694|, ~y$w_buff1~0=~y$w_buff1~0_In1194119694, ~y~0=~y~0_In1194119694, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1194119694, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194119694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:06:33,026 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:06:33,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-535062065 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-535062065 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-535062065| ~y$w_buff0_used~0_In-535062065) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-535062065| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-535062065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-535062065} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-535062065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-535062065, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-535062065|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:06:33,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In461229953 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In461229953 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In461229953 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In461229953 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out461229953| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In461229953 |ULTIMATE.start_main_#t~ite43_Out461229953|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In461229953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461229953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461229953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461229953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In461229953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461229953, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out461229953|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461229953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461229953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:06:33,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2021480680 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2021480680 256)))) (or (and (= ~y$r_buff0_thd0~0_In-2021480680 |ULTIMATE.start_main_#t~ite44_Out-2021480680|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2021480680|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021480680, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2021480680} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021480680, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2021480680, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2021480680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:06:33,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-619554891 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-619554891 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-619554891 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-619554891 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-619554891 |ULTIMATE.start_main_#t~ite45_Out-619554891|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-619554891|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-619554891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-619554891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-619554891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-619554891} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-619554891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-619554891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-619554891, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-619554891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-619554891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:06:33,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~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:06:33,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:06:33 BasicIcfg [2019-12-26 23:06:33,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:06:33,127 INFO L168 Benchmark]: Toolchain (without parser) took 13868.38 ms. Allocated memory was 138.9 MB in the beginning and 598.7 MB in the end (delta: 459.8 MB). Free memory was 102.4 MB in the beginning and 163.2 MB in the end (delta: -60.7 MB). Peak memory consumption was 399.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,128 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.29 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 102.2 MB in the beginning and 156.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.99 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,132 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.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:06:33,134 INFO L168 Benchmark]: RCFGBuilder took 806.97 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 107.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,135 INFO L168 Benchmark]: TraceAbstraction took 12162.55 ms. Allocated memory was 202.4 MB in the beginning and 598.7 MB in the end (delta: 396.4 MB). Free memory was 107.3 MB in the beginning and 163.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 340.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:33,145 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.29 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 102.2 MB in the beginning and 156.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.99 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.97 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 107.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12162.55 ms. Allocated memory was 202.4 MB in the beginning and 598.7 MB in the end (delta: 396.4 MB). Free memory was 107.3 MB in the beginning and 163.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 340.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 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(&t1547, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t1548, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 x = 1 [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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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: 11.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1438 SDslu, 2194 SDs, 0 SdLazy, 1138 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 32918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...