/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:28:42,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:28:42,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:28:42,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:28:42,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:28:42,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:28:42,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:28:43,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:28:43,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:28:43,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:28:43,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:28:43,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:28:43,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:28:43,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:28:43,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:28:43,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:28:43,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:28:43,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:28:43,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:28:43,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:28:43,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:28:43,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:28:43,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:28:43,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:28:43,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:28:43,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:28:43,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:28:43,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:28:43,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:28:43,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:28:43,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:28:43,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:28:43,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:28:43,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:28:43,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:28:43,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:28:43,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:28:43,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:28:43,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:28:43,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:28:43,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:28:43,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:28:43,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:28:43,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:28:43,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:28:43,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:28:43,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:28:43,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:28:43,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:28:43,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:28:43,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:28:43,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:28:43,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:28:43,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:28:43,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:28:43,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:28:43,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:28:43,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:28:43,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:28:43,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:28:43,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:28:43,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:28:43,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:28:43,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:28:43,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:28:43,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:28:43,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:28:43,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:28:43,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:28:43,097 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:28:43,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:28:43,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:28:43,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:28:43,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:28:43,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:28:43,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:28:43,419 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:28:43,420 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 06:28:43,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32eca969/50aa4635d45a4b61a87cd340e2d4d887/FLAGea92ff5e6 [2019-12-27 06:28:44,043 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:28:44,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 06:28:44,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32eca969/50aa4635d45a4b61a87cd340e2d4d887/FLAGea92ff5e6 [2019-12-27 06:28:44,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32eca969/50aa4635d45a4b61a87cd340e2d4d887 [2019-12-27 06:28:44,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:28:44,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:28:44,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:44,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:28:44,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:28:44,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:44" (1/1) ... [2019-12-27 06:28:44,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6328e86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:44, skipping insertion in model container [2019-12-27 06:28:44,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:44" (1/1) ... [2019-12-27 06:28:44,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:28:44,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:28:44,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:44,956 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:28:45,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:45,116 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:28:45,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45 WrapperNode [2019-12-27 06:28:45,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:45,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:45,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:28:45,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:28:45,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:45,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:28:45,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:28:45,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:28:45,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (1/1) ... [2019-12-27 06:28:45,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:28:45,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:28:45,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:28:45,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:28:45,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (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-27 06:28:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:28:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:28:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:28:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:28:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:28:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:28:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:28:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:28:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:28:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:28:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:28:45,285 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:28:45,961 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:28:45,961 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:28:45,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:45 BoogieIcfgContainer [2019-12-27 06:28:45,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:28:45,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:28:45,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:28:45,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:28:45,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:28:44" (1/3) ... [2019-12-27 06:28:45,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c48834f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:45, skipping insertion in model container [2019-12-27 06:28:45,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:45" (2/3) ... [2019-12-27 06:28:45,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c48834f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:45, skipping insertion in model container [2019-12-27 06:28:45,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:45" (3/3) ... [2019-12-27 06:28:45,971 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-12-27 06:28:45,982 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:28:45,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:28:45,990 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:28:45,991 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:28:46,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:46,158 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:28:46,180 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:28:46,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:28:46,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:28:46,181 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:28:46,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:28:46,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:28:46,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:28:46,181 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:28:46,203 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 06:28:46,204 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:46,314 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:46,315 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:46,327 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:46,346 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:46,390 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:46,390 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:46,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:46,410 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:28:46,412 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:28:49,626 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 06:28:49,746 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:28:49,772 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49804 [2019-12-27 06:28:49,772 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 06:28:49,776 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 06:28:50,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 06:28:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 06:28:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:28:50,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:50,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:28:50,202 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 792295, now seen corresponding path program 1 times [2019-12-27 06:28:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:50,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425978703] [2019-12-27 06:28:50,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:50,443 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-27 06:28:50,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425978703] [2019-12-27 06:28:50,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:50,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:28:50,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582311403] [2019-12-27 06:28:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:50,473 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 06:28:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:50,764 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 06:28:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:50,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:28:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:50,863 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 06:28:50,864 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 06:28:50,865 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-27 06:28:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 06:28:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 06:28:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 06:28:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 06:28:51,249 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 06:28:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 06:28:51,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 06:28:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:28:51,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:51,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:51,253 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1331077168, now seen corresponding path program 1 times [2019-12-27 06:28:51,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:51,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085131268] [2019-12-27 06:28:51,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:51,316 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-27 06:28:51,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085131268] [2019-12-27 06:28:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:51,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131697337] [2019-12-27 06:28:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:51,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:51,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:51,320 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 06:28:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:51,357 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 06:28:51,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:51,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:28:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:51,365 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 06:28:51,365 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 06:28:51,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 06:28:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 06:28:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 06:28:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 06:28:51,404 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 06:28:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:51,404 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 06:28:51,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 06:28:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:28:51,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:51,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:51,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash 265392593, now seen corresponding path program 1 times [2019-12-27 06:28:51,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:51,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216568691] [2019-12-27 06:28:51,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:51,548 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-27 06:28:51,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216568691] [2019-12-27 06:28:51,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:51,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:51,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623358486] [2019-12-27 06:28:51,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:51,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:51,552 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 06:28:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:51,690 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 06:28:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:51,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 06:28:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:51,701 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 06:28:51,701 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 06:28:51,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 06:28:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 06:28:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 06:28:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 06:28:51,745 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 06:28:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:51,746 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 06:28:51,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 06:28:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:28:51,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:51,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:51,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash 175245027, now seen corresponding path program 1 times [2019-12-27 06:28:51,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:51,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481301822] [2019-12-27 06:28:51,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:51,840 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-27 06:28:51,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481301822] [2019-12-27 06:28:51,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:51,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413877868] [2019-12-27 06:28:51,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:28:51,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:28:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:51,844 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 06:28:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:52,020 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 06:28:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:28:52,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:28:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:52,029 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 06:28:52,030 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 06:28:52,030 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-27 06:28:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 06:28:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 06:28:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 06:28:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 06:28:52,070 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 06:28:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:52,071 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 06:28:52,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:28:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 06:28:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:28:52,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:52,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:52,072 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 941909210, now seen corresponding path program 1 times [2019-12-27 06:28:52,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:52,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444792873] [2019-12-27 06:28:52,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:52,127 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-27 06:28:52,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444792873] [2019-12-27 06:28:52,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:52,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:52,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713962808] [2019-12-27 06:28:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:28:52,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:28:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:52,130 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 06:28:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:52,296 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 06:28:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:28:52,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:28:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:52,309 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 06:28:52,309 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 06:28:52,310 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-27 06:28:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 06:28:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 06:28:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 06:28:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 06:28:52,355 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 06:28:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:52,355 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 06:28:52,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:28:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 06:28:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:28:52,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:52,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:52,358 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1601113905, now seen corresponding path program 1 times [2019-12-27 06:28:52,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:52,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425449143] [2019-12-27 06:28:52,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:52,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-27 06:28:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425449143] [2019-12-27 06:28:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:52,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872560844] [2019-12-27 06:28:52,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:28:52,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:28:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:28:52,481 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 06:28:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:52,734 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 06:28:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:28:52,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:28:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:52,757 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 06:28:52,757 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 06:28:52,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:28:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 06:28:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 06:28:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 06:28:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 06:28:52,821 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 06:28:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:52,821 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 06:28:52,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:28:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 06:28:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:28:52,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:52,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:52,825 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 16465726, now seen corresponding path program 1 times [2019-12-27 06:28:52,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:52,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953802997] [2019-12-27 06:28:52,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:52,896 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-27 06:28:52,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953802997] [2019-12-27 06:28:52,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:52,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:52,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915660681] [2019-12-27 06:28:52,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:52,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:52,899 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 06:28:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:52,941 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 06:28:52,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:52,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 06:28:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:52,951 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 06:28:52,951 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 06:28:52,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 06:28:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 06:28:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 06:28:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 06:28:53,048 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 06:28:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:53,049 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 06:28:53,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 06:28:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:28:53,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:53,051 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] [2019-12-27 06:28:53,052 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1111732337, now seen corresponding path program 1 times [2019-12-27 06:28:53,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:53,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843522988] [2019-12-27 06:28:53,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:53,099 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-27 06:28:53,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843522988] [2019-12-27 06:28:53,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:53,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:53,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557856405] [2019-12-27 06:28:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:53,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:53,102 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 3 states. [2019-12-27 06:28:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:53,119 INFO L93 Difference]: Finished difference Result 3059 states and 6636 transitions. [2019-12-27 06:28:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:53,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 06:28:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:53,123 INFO L225 Difference]: With dead ends: 3059 [2019-12-27 06:28:53,124 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 06:28:53,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 06:28:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1385. [2019-12-27 06:28:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-12-27 06:28:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2946 transitions. [2019-12-27 06:28:53,177 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2946 transitions. Word has length 26 [2019-12-27 06:28:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:53,178 INFO L462 AbstractCegarLoop]: Abstraction has 1385 states and 2946 transitions. [2019-12-27 06:28:53,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2946 transitions. [2019-12-27 06:28:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:28:53,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:53,180 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] [2019-12-27 06:28:53,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 858483252, now seen corresponding path program 1 times [2019-12-27 06:28:53,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:53,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435329856] [2019-12-27 06:28:53,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:53,247 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-27 06:28:53,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435329856] [2019-12-27 06:28:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:53,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:53,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201086749] [2019-12-27 06:28:53,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:28:53,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:28:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:28:53,250 INFO L87 Difference]: Start difference. First operand 1385 states and 2946 transitions. Second operand 5 states. [2019-12-27 06:28:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:53,393 INFO L93 Difference]: Finished difference Result 1390 states and 2937 transitions. [2019-12-27 06:28:53,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:28:53,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:28:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:53,399 INFO L225 Difference]: With dead ends: 1390 [2019-12-27 06:28:53,399 INFO L226 Difference]: Without dead ends: 1390 [2019-12-27 06:28:53,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:28:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-27 06:28:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1347. [2019-12-27 06:28:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-12-27 06:28:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2871 transitions. [2019-12-27 06:28:53,428 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2871 transitions. Word has length 26 [2019-12-27 06:28:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:53,429 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2871 transitions. [2019-12-27 06:28:53,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:28:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2871 transitions. [2019-12-27 06:28:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:28:53,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:53,433 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-27 06:28:53,433 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1256798795, now seen corresponding path program 1 times [2019-12-27 06:28:53,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:53,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830184868] [2019-12-27 06:28:53,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:53,522 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-27 06:28:53,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830184868] [2019-12-27 06:28:53,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:53,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:28:53,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713565777] [2019-12-27 06:28:53,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:28:53,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:53,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:28:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:28:53,526 INFO L87 Difference]: Start difference. First operand 1347 states and 2871 transitions. Second operand 5 states. [2019-12-27 06:28:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:53,999 INFO L93 Difference]: Finished difference Result 2150 states and 4509 transitions. [2019-12-27 06:28:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:28:54,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:28:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:54,005 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 06:28:54,005 INFO L226 Difference]: Without dead ends: 2150 [2019-12-27 06:28:54,005 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-27 06:28:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-12-27 06:28:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1941. [2019-12-27 06:28:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-12-27 06:28:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4107 transitions. [2019-12-27 06:28:54,046 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4107 transitions. Word has length 27 [2019-12-27 06:28:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:54,047 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 4107 transitions. [2019-12-27 06:28:54,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:28:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4107 transitions. [2019-12-27 06:28:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:28:54,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:54,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:54,050 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -374854062, now seen corresponding path program 1 times [2019-12-27 06:28:54,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:54,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204220190] [2019-12-27 06:28:54,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:54,093 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-27 06:28:54,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204220190] [2019-12-27 06:28:54,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:54,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:54,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767245944] [2019-12-27 06:28:54,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:28:54,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:54,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:28:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:54,095 INFO L87 Difference]: Start difference. First operand 1941 states and 4107 transitions. Second operand 4 states. [2019-12-27 06:28:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:54,110 INFO L93 Difference]: Finished difference Result 1087 states and 2170 transitions. [2019-12-27 06:28:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:28:54,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 06:28:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:54,112 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 06:28:54,113 INFO L226 Difference]: Without dead ends: 981 [2019-12-27 06:28:54,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-27 06:28:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 909. [2019-12-27 06:28:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 06:28:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1885 transitions. [2019-12-27 06:28:54,131 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1885 transitions. Word has length 28 [2019-12-27 06:28:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:54,131 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1885 transitions. [2019-12-27 06:28:54,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:28:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1885 transitions. [2019-12-27 06:28:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:28:54,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:54,136 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-27 06:28:54,136 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1671814948, now seen corresponding path program 1 times [2019-12-27 06:28:54,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:54,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183622249] [2019-12-27 06:28:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:54,222 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-27 06:28:54,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183622249] [2019-12-27 06:28:54,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:54,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:28:54,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255163471] [2019-12-27 06:28:54,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:28:54,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:28:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:28:54,224 INFO L87 Difference]: Start difference. First operand 909 states and 1885 transitions. Second operand 7 states. [2019-12-27 06:28:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:54,462 INFO L93 Difference]: Finished difference Result 1569 states and 3170 transitions. [2019-12-27 06:28:54,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:28:54,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:28:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:54,465 INFO L225 Difference]: With dead ends: 1569 [2019-12-27 06:28:54,465 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 06:28:54,465 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-27 06:28:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 06:28:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 907. [2019-12-27 06:28:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 06:28:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1857 transitions. [2019-12-27 06:28:54,484 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1857 transitions. Word has length 51 [2019-12-27 06:28:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:54,484 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1857 transitions. [2019-12-27 06:28:54,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:28:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1857 transitions. [2019-12-27 06:28:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:28:54,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:54,487 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-27 06:28:54,487 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:54,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:54,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1673779650, now seen corresponding path program 2 times [2019-12-27 06:28:54,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:54,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429223659] [2019-12-27 06:28:54,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:54,595 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-27 06:28:54,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429223659] [2019-12-27 06:28:54,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:54,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:28:54,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520533955] [2019-12-27 06:28:54,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:28:54,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:28:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:28:54,597 INFO L87 Difference]: Start difference. First operand 907 states and 1857 transitions. Second operand 6 states. [2019-12-27 06:28:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:55,102 INFO L93 Difference]: Finished difference Result 1063 states and 2153 transitions. [2019-12-27 06:28:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:28:55,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 06:28:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:55,105 INFO L225 Difference]: With dead ends: 1063 [2019-12-27 06:28:55,106 INFO L226 Difference]: Without dead ends: 1063 [2019-12-27 06:28:55,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:28:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-12-27 06:28:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 937. [2019-12-27 06:28:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 06:28:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1912 transitions. [2019-12-27 06:28:55,127 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1912 transitions. Word has length 51 [2019-12-27 06:28:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:55,127 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1912 transitions. [2019-12-27 06:28:55,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:28:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1912 transitions. [2019-12-27 06:28:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:28:55,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:55,130 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-27 06:28:55,130 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash -251445194, now seen corresponding path program 3 times [2019-12-27 06:28:55,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:55,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376694565] [2019-12-27 06:28:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:55,197 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-27 06:28:55,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376694565] [2019-12-27 06:28:55,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:55,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:55,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382912209] [2019-12-27 06:28:55,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:55,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:55,199 INFO L87 Difference]: Start difference. First operand 937 states and 1912 transitions. Second operand 3 states. [2019-12-27 06:28:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:55,257 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-27 06:28:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:28:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:55,260 INFO L225 Difference]: With dead ends: 1175 [2019-12-27 06:28:55,261 INFO L226 Difference]: Without dead ends: 1175 [2019-12-27 06:28:55,261 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-27 06:28:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-27 06:28:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-27 06:28:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 06:28:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-27 06:28:55,281 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-27 06:28:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:55,282 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-27 06:28:55,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-27 06:28:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:28:55,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:55,285 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-27 06:28:55,285 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 187010410, now seen corresponding path program 1 times [2019-12-27 06:28:55,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:55,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665601458] [2019-12-27 06:28:55,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:28:55,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665601458] [2019-12-27 06:28:55,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:55,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:28:55,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543655206] [2019-12-27 06:28:55,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:28:55,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:55,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:28:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:28:55,393 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 7 states. [2019-12-27 06:28:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:55,997 INFO L93 Difference]: Finished difference Result 1141 states and 2310 transitions. [2019-12-27 06:28:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:28:55,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 06:28:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:56,000 INFO L225 Difference]: With dead ends: 1141 [2019-12-27 06:28:56,000 INFO L226 Difference]: Without dead ends: 1141 [2019-12-27 06:28:56,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:28:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-12-27 06:28:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1039. [2019-12-27 06:28:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 06:28:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 06:28:56,023 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 06:28:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:56,024 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 06:28:56,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:28:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 06:28:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:28:56,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:56,027 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-27 06:28:56,028 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash 419680803, now seen corresponding path program 1 times [2019-12-27 06:28:56,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:56,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137374259] [2019-12-27 06:28:56,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:56,158 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-27 06:28:56,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137374259] [2019-12-27 06:28:56,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:56,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:28:56,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514105542] [2019-12-27 06:28:56,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:28:56,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:28:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:28:56,164 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 6 states. [2019-12-27 06:28:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:56,635 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-27 06:28:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:28:56,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 06:28:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:56,639 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 06:28:56,639 INFO L226 Difference]: Without dead ends: 1291 [2019-12-27 06:28:56,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:28:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-27 06:28:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-27 06:28:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 06:28:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-27 06:28:56,661 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-27 06:28:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:56,661 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-27 06:28:56,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:28:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-27 06:28:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:28:56,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:56,664 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-27 06:28:56,665 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1329705586, now seen corresponding path program 2 times [2019-12-27 06:28:56,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:56,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527260364] [2019-12-27 06:28:56,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:56,762 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-27 06:28:56,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527260364] [2019-12-27 06:28:56,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:56,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:56,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813052095] [2019-12-27 06:28:56,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:56,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:56,765 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-27 06:28:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:56,782 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-27 06:28:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:56,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:28:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:56,784 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 06:28:56,784 INFO L226 Difference]: Without dead ends: 1075 [2019-12-27 06:28:56,785 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-27 06:28:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-27 06:28:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-27 06:28:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 06:28:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-27 06:28:56,808 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-27 06:28:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:56,809 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-27 06:28:56,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-27 06:28:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:28:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:56,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:56,812 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash 821444371, now seen corresponding path program 1 times [2019-12-27 06:28:56,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:56,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796813203] [2019-12-27 06:28:56,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:28:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:28:56,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:28:56,976 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:28:56,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1093~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_24 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~z$r_buff1_thd2~0_49) (= |v_ULTIMATE.start_main_~#t1093~0.offset_17| 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1093~0.base_22|) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_9) (= 0 v_~z$r_buff1_thd1~0_20) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1093~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1093~0.base_22|) |v_ULTIMATE.start_main_~#t1093~0.offset_17| 0)) |v_#memory_int_9|) (= v_~x~0_18 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_22|)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd0~0_27) (= v_~z$r_buff0_thd2~0_78 0) (= 0 v_~z$w_buff1_used~0_65) (= v_~z$r_buff0_thd1~0_28 0) (= 0 |v_#NULL.base_5|) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_22| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_23, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, #length=|v_#length_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 06:28:56,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-12-27 06:28:56,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= 1 ~x~0_Out267551974) (= ~z$r_buff1_thd0~0_Out267551974 ~z$r_buff0_thd0~0_In267551974) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In267551974 0)) (= ~z$r_buff1_thd2~0_Out267551974 ~z$r_buff0_thd2~0_In267551974) (= ~z$r_buff0_thd1~0_Out267551974 1) (= ~z$r_buff0_thd1~0_In267551974 ~z$r_buff1_thd1~0_Out267551974)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In267551974, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In267551974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In267551974, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In267551974} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In267551974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out267551974, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out267551974, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out267551974, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In267551974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out267551974, ~x~0=~x~0_Out267551974, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In267551974} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 06:28:56,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1793919565 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1793919565 256)))) (or (and (= ~z$w_buff0_used~0_In-1793919565 |P0Thread1of1ForFork0_#t~ite5_Out-1793919565|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1793919565|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1793919565, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1793919565} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1793919565|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1793919565, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1793919565} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:28:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1810509763 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1810509763 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1810509763 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1810509763 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1810509763 |P0Thread1of1ForFork0_#t~ite6_Out1810509763|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1810509763|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1810509763, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1810509763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1810509763, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1810509763} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1810509763|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1810509763, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1810509763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1810509763, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1810509763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:28:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1938553081 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1938553081 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1938553081) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1938553081 ~z$r_buff0_thd1~0_Out-1938553081) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1938553081, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1938553081} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1938553081, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1938553081|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1938553081} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:28:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1405583305 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1405583305 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1405583305 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1405583305 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1405583305|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In1405583305 |P0Thread1of1ForFork0_#t~ite8_Out1405583305|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1405583305, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1405583305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405583305, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1405583305} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1405583305, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1405583305|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1405583305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405583305, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1405583305} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:28:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_16)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:28:56,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd2~0_53 v_~z$r_buff0_thd2~0_52)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_53} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:28:56,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L773-->L773-8: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In416973173 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In416973173 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In416973173 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out416973173| |P1Thread1of1ForFork1_#t~ite30_Out416973173|)) (.cse5 (= 0 (mod ~z$r_buff1_thd2~0_In416973173 256))) (.cse4 (= (mod ~z$r_buff0_thd2~0_In416973173 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In416973173| |P1Thread1of1ForFork1_#t~ite28_Out416973173|) (or (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out416973173| ~z$r_buff1_thd2~0_In416973173) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out416973173| |P1Thread1of1ForFork1_#t~ite29_In416973173|) (= ~z$r_buff1_thd2~0_In416973173 |P1Thread1of1ForFork1_#t~ite30_Out416973173|)))) (let ((.cse6 (not .cse4))) (and (not .cse2) (or (not .cse3) .cse6) .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out416973173| |P1Thread1of1ForFork1_#t~ite28_Out416973173|) (or .cse6 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite28_Out416973173| 0))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In416973173|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In416973173, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In416973173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In416973173, ~weak$$choice2~0=~weak$$choice2~0_In416973173, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In416973173, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In416973173|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out416973173|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out416973173|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In416973173, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In416973173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In416973173, ~weak$$choice2~0=~weak$$choice2~0_In416973173, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In416973173, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out416973173|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:28:56,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:28:56,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-723192859 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-723192859 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-723192859| ~z$w_buff1~0_In-723192859) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-723192859| ~z~0_In-723192859) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-723192859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-723192859, ~z$w_buff1~0=~z$w_buff1~0_In-723192859, ~z~0=~z~0_In-723192859} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-723192859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-723192859, ~z$w_buff1~0=~z$w_buff1~0_In-723192859, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-723192859|, ~z~0=~z~0_In-723192859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 06:28:56,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 06:28:56,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1021830651 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1021830651 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1021830651| ~z$w_buff0_used~0_In1021830651) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1021830651|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1021830651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1021830651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1021830651, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1021830651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1021830651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:28:56,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1384616441 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1384616441 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1384616441 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1384616441 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1384616441| ~z$w_buff1_used~0_In1384616441) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1384616441|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1384616441, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1384616441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1384616441, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1384616441} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1384616441, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1384616441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1384616441, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1384616441|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1384616441} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:28:57,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1378543886 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1378543886 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1378543886| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1378543886 |P1Thread1of1ForFork1_#t~ite36_Out1378543886|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1378543886, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1378543886} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1378543886, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1378543886, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1378543886|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:28:57,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-458827853 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-458827853 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-458827853 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-458827853 256)))) (or (and (= ~z$r_buff1_thd2~0_In-458827853 |P1Thread1of1ForFork1_#t~ite37_Out-458827853|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458827853|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-458827853, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-458827853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-458827853, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-458827853} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-458827853, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-458827853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-458827853, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-458827853, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458827853|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:28:57,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:28:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:28:57,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In257665744 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out257665744| |ULTIMATE.start_main_#t~ite40_Out257665744|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In257665744 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out257665744| ~z~0_In257665744) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out257665744| ~z$w_buff1~0_In257665744) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In257665744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In257665744, ~z$w_buff1~0=~z$w_buff1~0_In257665744, ~z~0=~z~0_In257665744} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out257665744|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out257665744|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In257665744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In257665744, ~z$w_buff1~0=~z$w_buff1~0_In257665744, ~z~0=~z~0_In257665744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:28:57,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In711992150 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In711992150 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out711992150| ~z$w_buff0_used~0_In711992150)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out711992150| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In711992150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In711992150} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In711992150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In711992150, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out711992150|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:28:57,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-625680274 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-625680274 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-625680274 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-625680274 256) 0))) (or (and (= ~z$w_buff1_used~0_In-625680274 |ULTIMATE.start_main_#t~ite43_Out-625680274|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-625680274|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-625680274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-625680274, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625680274, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625680274} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-625680274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-625680274, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625680274, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625680274, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-625680274|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:28:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-528855352 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-528855352 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-528855352| ~z$r_buff0_thd0~0_In-528855352)) (and (= |ULTIMATE.start_main_#t~ite44_Out-528855352| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-528855352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-528855352} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-528855352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-528855352, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-528855352|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:28:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-526836389 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-526836389 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-526836389 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-526836389 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-526836389| ~z$r_buff1_thd0~0_In-526836389) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-526836389| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526836389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526836389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-526836389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-526836389} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526836389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526836389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-526836389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-526836389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-526836389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:28:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_19) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:28:57,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:28:57 BasicIcfg [2019-12-27 06:28:57,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:28:57,086 INFO L168 Benchmark]: Toolchain (without parser) took 12691.55 ms. Allocated memory was 144.7 MB in the beginning and 393.2 MB in the end (delta: 248.5 MB). Free memory was 100.9 MB in the beginning and 199.1 MB in the end (delta: -98.3 MB). Peak memory consumption was 150.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,087 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:28:57,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.18 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 154.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,089 INFO L168 Benchmark]: Boogie Preprocessor took 36.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,090 INFO L168 Benchmark]: RCFGBuilder took 748.29 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 106.3 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,090 INFO L168 Benchmark]: TraceAbstraction took 11120.88 ms. Allocated memory was 201.3 MB in the beginning and 393.2 MB in the end (delta: 191.9 MB). Free memory was 105.4 MB in the beginning and 199.1 MB in the end (delta: -93.8 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:57,094 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.18 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 154.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.29 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 106.3 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11120.88 ms. Allocated memory was 201.3 MB in the beginning and 393.2 MB in the end (delta: 191.9 MB). Free memory was 105.4 MB in the beginning and 199.1 MB in the end (delta: -93.8 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 4431 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49804 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2224 SDtfs, 1538 SDslu, 4124 SDs, 0 SdLazy, 2573 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3214 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 56603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...