/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/rfi001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:00,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:00,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:00,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:00,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:00,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:00,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:00,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:00,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:00,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:00,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:00,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:00,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:00,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:00,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:00,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:00,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:00,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:00,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:00,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:00,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:00,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:00,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:00,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:00,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:00,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:00,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:00,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:00,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:00,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:00,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:00,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:00,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:00,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:00,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:00,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:00,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:00,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:00,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:00,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:00,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:00,116 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 07:04:00,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:00,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:00,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:00,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:00,139 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:00,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:00,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:00,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:00,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:00,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:00,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:00,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:00,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:00,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:00,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:00,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:00,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:00,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:00,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:00,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:00,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:00,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:00,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:00,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:00,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:00,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:00,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:00,145 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:00,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:00,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:00,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:00,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:00,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:00,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:00,429 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:00,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-27 07:04:00,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5894c1e/89fc3c55bffd4e40ae0d60f28dab07a9/FLAG112c4af49 [2019-12-27 07:04:00,994 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:00,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-27 07:04:01,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5894c1e/89fc3c55bffd4e40ae0d60f28dab07a9/FLAG112c4af49 [2019-12-27 07:04:01,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5894c1e/89fc3c55bffd4e40ae0d60f28dab07a9 [2019-12-27 07:04:01,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:01,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:01,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:01,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:01,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:01,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:01" (1/1) ... [2019-12-27 07:04:01,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:01, skipping insertion in model container [2019-12-27 07:04:01,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:01" (1/1) ... [2019-12-27 07:04:01,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:01,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:01,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:01,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:02,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:02,121 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:02,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02 WrapperNode [2019-12-27 07:04:02,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:02,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:02,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:02,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:02,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:02,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:02,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:02,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:02,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... [2019-12-27 07:04:02,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:02,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:02,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:02,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:02,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:02,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:02,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:02,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:02,295 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 07:04:03,043 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:03,043 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:03,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:03 BoogieIcfgContainer [2019-12-27 07:04:03,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:03,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:03,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:03,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:03,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:01" (1/3) ... [2019-12-27 07:04:03,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f28e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:03, skipping insertion in model container [2019-12-27 07:04:03,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:02" (2/3) ... [2019-12-27 07:04:03,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f28e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:03, skipping insertion in model container [2019-12-27 07:04:03,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:03" (3/3) ... [2019-12-27 07:04:03,057 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc.i [2019-12-27 07:04:03,067 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:03,067 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:03,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:03,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:03,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,202 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:03,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:03,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:03,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:03,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:03,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:03,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:03,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:03,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:03,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:03,265 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 07:04:03,267 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:03,363 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:03,363 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:03,381 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 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:03,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:03,489 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:03,490 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:03,500 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 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:03,518 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:04:03,519 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:06,664 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:06,778 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:04:06,803 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49085 [2019-12-27 07:04:06,804 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 07:04:06,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 07:04:07,239 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 07:04:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 07:04:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:04:07,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:07,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:04:07,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 791333, now seen corresponding path program 1 times [2019-12-27 07:04:07,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:07,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578382069] [2019-12-27 07:04:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:04:07,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578382069] [2019-12-27 07:04:07,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:07,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:07,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723006116] [2019-12-27 07:04:07,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:07,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:07,475 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 07:04:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:07,809 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 07:04:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:07,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:04:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:07,899 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 07:04:07,900 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 07:04:07,901 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 07:04:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 07:04:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 07:04:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 07:04:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 07:04:08,375 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 07:04:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 07:04:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 07:04:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:08,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:08,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:08,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 912855206, now seen corresponding path program 1 times [2019-12-27 07:04:08,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:08,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755308926] [2019-12-27 07:04:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:08,454 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 07:04:08,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755308926] [2019-12-27 07:04:08,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:08,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:08,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454429748] [2019-12-27 07:04:08,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:08,459 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 07:04:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:08,495 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 07:04:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:08,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 07:04:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:08,503 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 07:04:08,504 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 07:04:08,505 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 07:04:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 07:04:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 07:04:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 07:04:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 07:04:08,534 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 07:04:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:08,535 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 07:04:08,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 07:04:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:08,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:08,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:08,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash 124584310, now seen corresponding path program 1 times [2019-12-27 07:04:08,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:08,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388356227] [2019-12-27 07:04:08,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:08,599 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 07:04:08,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388356227] [2019-12-27 07:04:08,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:08,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:08,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050641775] [2019-12-27 07:04:08,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:08,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:08,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:08,601 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 07:04:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:08,689 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 07:04:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:08,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:04:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:08,705 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 07:04:08,706 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 07:04:08,706 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 07:04:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 07:04:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 07:04:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 07:04:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 07:04:08,763 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 07:04:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:08,764 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 07:04:08,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 07:04:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:08,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:08,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:08,766 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 35390056, now seen corresponding path program 1 times [2019-12-27 07:04:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:08,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889569850] [2019-12-27 07:04:08,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:08,888 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 07:04:08,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889569850] [2019-12-27 07:04:08,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:08,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:08,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182138743] [2019-12-27 07:04:08,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:08,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:08,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:08,891 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 07:04:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:09,096 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 07:04:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:09,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:04:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:09,106 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 07:04:09,107 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 07:04:09,107 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 07:04:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 07:04:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 07:04:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 07:04:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 07:04:09,150 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 07:04:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 07:04:09,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 07:04:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:09,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:09,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:09,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:09,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash 801099966, now seen corresponding path program 1 times [2019-12-27 07:04:09,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:09,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073328662] [2019-12-27 07:04:09,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:09,230 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 07:04:09,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073328662] [2019-12-27 07:04:09,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:09,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:09,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385832538] [2019-12-27 07:04:09,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:09,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:09,232 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 07:04:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:09,399 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 07:04:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:09,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:04:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:09,410 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 07:04:09,411 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 07:04:09,411 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 07:04:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 07:04:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 07:04:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 07:04:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 07:04:09,455 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 07:04:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:09,456 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 07:04:09,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 07:04:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:09,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:09,459 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 07:04:09,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash -738044695, now seen corresponding path program 1 times [2019-12-27 07:04:09,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:09,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472432591] [2019-12-27 07:04:09,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:09,582 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 07:04:09,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472432591] [2019-12-27 07:04:09,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:09,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:09,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711814665] [2019-12-27 07:04:09,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:09,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:09,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:09,584 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 07:04:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:09,876 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 07:04:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:09,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:04:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:09,898 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 07:04:09,898 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 07:04:09,898 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 07:04:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 07:04:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 07:04:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 07:04:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 07:04:09,950 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 07:04:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:09,951 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 07:04:09,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 07:04:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:09,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:09,954 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 07:04:09,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash 602591181, now seen corresponding path program 1 times [2019-12-27 07:04:09,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:09,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390995522] [2019-12-27 07:04:09,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:10,029 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 07:04:10,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390995522] [2019-12-27 07:04:10,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:10,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:10,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777819473] [2019-12-27 07:04:10,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:10,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:10,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:10,031 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 07:04:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:10,070 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 07:04:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:04:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:10,076 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 07:04:10,077 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 07:04:10,077 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 07:04:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 07:04:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 07:04:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 07:04:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 07:04:10,123 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 07:04:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:10,123 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 07:04:10,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 07:04:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:04:10,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:10,126 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 07:04:10,127 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2104804157, now seen corresponding path program 1 times [2019-12-27 07:04:10,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:10,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648891470] [2019-12-27 07:04:10,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:10,176 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 07:04:10,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648891470] [2019-12-27 07:04:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:10,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695860383] [2019-12-27 07:04:10,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:10,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:10,178 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 07:04:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:10,194 INFO L93 Difference]: Finished difference Result 1053 states and 2169 transitions. [2019-12-27 07:04:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:04:10,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 07:04:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:10,198 INFO L225 Difference]: With dead ends: 1053 [2019-12-27 07:04:10,198 INFO L226 Difference]: Without dead ends: 1053 [2019-12-27 07:04:10,199 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 07:04:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-27 07:04:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2019-12-27 07:04:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 07:04:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2062 transitions. [2019-12-27 07:04:10,218 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2062 transitions. Word has length 26 [2019-12-27 07:04:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:10,218 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2062 transitions. [2019-12-27 07:04:10,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2062 transitions. [2019-12-27 07:04:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:04:10,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:10,221 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 07:04:10,221 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash -134458557, now seen corresponding path program 1 times [2019-12-27 07:04:10,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:10,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032351304] [2019-12-27 07:04:10,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:10,295 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 07:04:10,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032351304] [2019-12-27 07:04:10,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:10,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:10,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295037765] [2019-12-27 07:04:10,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:10,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:10,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:10,298 INFO L87 Difference]: Start difference. First operand 995 states and 2062 transitions. Second operand 5 states. [2019-12-27 07:04:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:10,485 INFO L93 Difference]: Finished difference Result 1129 states and 2304 transitions. [2019-12-27 07:04:10,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:10,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:04:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:10,490 INFO L225 Difference]: With dead ends: 1129 [2019-12-27 07:04:10,490 INFO L226 Difference]: Without dead ends: 1129 [2019-12-27 07:04:10,491 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 07:04:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-27 07:04:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 904. [2019-12-27 07:04:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-27 07:04:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1874 transitions. [2019-12-27 07:04:10,508 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1874 transitions. Word has length 26 [2019-12-27 07:04:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:10,511 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1874 transitions. [2019-12-27 07:04:10,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1874 transitions. [2019-12-27 07:04:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:10,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:10,514 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 07:04:10,515 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash 830310095, now seen corresponding path program 1 times [2019-12-27 07:04:10,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:10,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799405891] [2019-12-27 07:04:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:10,573 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 07:04:10,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799405891] [2019-12-27 07:04:10,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:10,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:10,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344862217] [2019-12-27 07:04:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:10,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:10,575 INFO L87 Difference]: Start difference. First operand 904 states and 1874 transitions. Second operand 3 states. [2019-12-27 07:04:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:10,587 INFO L93 Difference]: Finished difference Result 1410 states and 2964 transitions. [2019-12-27 07:04:10,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:10,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:04:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:10,590 INFO L225 Difference]: With dead ends: 1410 [2019-12-27 07:04:10,590 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 07:04:10,591 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 07:04:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 07:04:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-27 07:04:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 07:04:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1169 transitions. [2019-12-27 07:04:10,602 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1169 transitions. Word has length 51 [2019-12-27 07:04:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:10,603 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1169 transitions. [2019-12-27 07:04:10,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1169 transitions. [2019-12-27 07:04:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:10,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:10,605 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 07:04:10,606 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:10,606 INFO L82 PathProgramCache]: Analyzing trace with hash 365260025, now seen corresponding path program 2 times [2019-12-27 07:04:10,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:10,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064788058] [2019-12-27 07:04:10,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:10,746 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 07:04:10,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064788058] [2019-12-27 07:04:10,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:10,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:10,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728404874] [2019-12-27 07:04:10,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:04:10,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:10,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:04:10,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:10,749 INFO L87 Difference]: Start difference. First operand 548 states and 1169 transitions. Second operand 7 states. [2019-12-27 07:04:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:10,946 INFO L93 Difference]: Finished difference Result 1122 states and 2322 transitions. [2019-12-27 07:04:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:04:10,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 07:04:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:10,949 INFO L225 Difference]: With dead ends: 1122 [2019-12-27 07:04:10,949 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 07:04:10,950 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 07:04:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 07:04:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 613. [2019-12-27 07:04:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 07:04:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1276 transitions. [2019-12-27 07:04:10,962 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1276 transitions. Word has length 51 [2019-12-27 07:04:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:10,963 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1276 transitions. [2019-12-27 07:04:10,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:04:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1276 transitions. [2019-12-27 07:04:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:10,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:10,965 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 07:04:10,965 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash 372470905, now seen corresponding path program 3 times [2019-12-27 07:04:10,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:10,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832696424] [2019-12-27 07:04:10,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:11,041 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 07:04:11,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832696424] [2019-12-27 07:04:11,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:11,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:11,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045544410] [2019-12-27 07:04:11,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:11,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:11,043 INFO L87 Difference]: Start difference. First operand 613 states and 1276 transitions. Second operand 3 states. [2019-12-27 07:04:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:11,098 INFO L93 Difference]: Finished difference Result 758 states and 1575 transitions. [2019-12-27 07:04:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:11,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:04:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:11,101 INFO L225 Difference]: With dead ends: 758 [2019-12-27 07:04:11,101 INFO L226 Difference]: Without dead ends: 758 [2019-12-27 07:04:11,102 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 07:04:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-27 07:04:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 670. [2019-12-27 07:04:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 07:04:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1399 transitions. [2019-12-27 07:04:11,115 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1399 transitions. Word has length 51 [2019-12-27 07:04:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:11,116 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1399 transitions. [2019-12-27 07:04:11,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1399 transitions. [2019-12-27 07:04:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:11,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:11,118 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 07:04:11,118 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 679432093, now seen corresponding path program 1 times [2019-12-27 07:04:11,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:11,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572597698] [2019-12-27 07:04:11,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:11,456 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 07:04:11,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572597698] [2019-12-27 07:04:11,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:11,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:04:11,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445000175] [2019-12-27 07:04:11,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:04:11,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:04:11,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:04:11,459 INFO L87 Difference]: Start difference. First operand 670 states and 1399 transitions. Second operand 9 states. [2019-12-27 07:04:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:12,203 INFO L93 Difference]: Finished difference Result 1222 states and 2473 transitions. [2019-12-27 07:04:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:04:12,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 07:04:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:12,208 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 07:04:12,208 INFO L226 Difference]: Without dead ends: 1198 [2019-12-27 07:04:12,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:04:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-12-27 07:04:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1014. [2019-12-27 07:04:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 07:04:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2079 transitions. [2019-12-27 07:04:12,229 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2079 transitions. Word has length 52 [2019-12-27 07:04:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:12,229 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2079 transitions. [2019-12-27 07:04:12,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:04:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2079 transitions. [2019-12-27 07:04:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:12,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:12,284 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 07:04:12,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 292599181, now seen corresponding path program 1 times [2019-12-27 07:04:12,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:12,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223130152] [2019-12-27 07:04:12,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:12,356 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 07:04:12,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223130152] [2019-12-27 07:04:12,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:12,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:12,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606141570] [2019-12-27 07:04:12,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:12,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:12,358 INFO L87 Difference]: Start difference. First operand 1014 states and 2079 transitions. Second operand 4 states. [2019-12-27 07:04:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:12,423 INFO L93 Difference]: Finished difference Result 1003 states and 2046 transitions. [2019-12-27 07:04:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:04:12,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 07:04:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:12,425 INFO L225 Difference]: With dead ends: 1003 [2019-12-27 07:04:12,426 INFO L226 Difference]: Without dead ends: 1003 [2019-12-27 07:04:12,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:04:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-12-27 07:04:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 933. [2019-12-27 07:04:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-12-27 07:04:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1905 transitions. [2019-12-27 07:04:12,443 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1905 transitions. Word has length 52 [2019-12-27 07:04:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:12,443 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1905 transitions. [2019-12-27 07:04:12,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1905 transitions. [2019-12-27 07:04:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:12,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:12,446 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 07:04:12,446 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash -267803227, now seen corresponding path program 2 times [2019-12-27 07:04:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:12,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678051092] [2019-12-27 07:04:12,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:12,509 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 07:04:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678051092] [2019-12-27 07:04:12,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:12,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:12,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019429124] [2019-12-27 07:04:12,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:12,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:12,512 INFO L87 Difference]: Start difference. First operand 933 states and 1905 transitions. Second operand 3 states. [2019-12-27 07:04:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:12,523 INFO L93 Difference]: Finished difference Result 933 states and 1904 transitions. [2019-12-27 07:04:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:12,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:04:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:12,525 INFO L225 Difference]: With dead ends: 933 [2019-12-27 07:04:12,525 INFO L226 Difference]: Without dead ends: 933 [2019-12-27 07:04:12,526 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 07:04:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-27 07:04:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 713. [2019-12-27 07:04:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-27 07:04:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1471 transitions. [2019-12-27 07:04:12,542 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1471 transitions. Word has length 52 [2019-12-27 07:04:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:12,543 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1471 transitions. [2019-12-27 07:04:12,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1471 transitions. [2019-12-27 07:04:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:04:12,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:12,545 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 07:04:12,545 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1093323660, now seen corresponding path program 1 times [2019-12-27 07:04:12,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:12,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303574572] [2019-12-27 07:04:12,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:12,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:04:12,711 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:04:12,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_27 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff1~0_22) (= v_~y~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_23| 1)) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~x$w_buff0_used~0_100) (= 0 v_~x$w_buff0~0_23) (= 0 v_~x$r_buff0_thd0~0_19) (= 0 v_~x$r_buff0_thd2~0_78) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1605~0.base_23| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1605~0.base_23|) |v_ULTIMATE.start_main_~#t1605~0.offset_18| 0))) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_23|) 0) (= 0 v_~x$read_delayed~0_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1605~0.base_23|) (= v_~x$r_buff1_thd2~0_49 0) (= v_~x$mem_tmp~0_8 0) (= 0 v_~x$r_buff0_thd1~0_27) (= 0 |v_#NULL.base_6|) (= v_~x$r_buff1_thd1~0_21 0) (= v_~x$flush_delayed~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1605~0.base_23| 4)) (= 0 v_~weak$$choice2~0_35) (= |v_ULTIMATE.start_main_~#t1605~0.offset_18| 0) (= v_~x~0_22 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~z~0_8) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ULTIMATE.start_main_~#t1605~0.base=|v_ULTIMATE.start_main_~#t1605~0.base_23|, 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|, ULTIMATE.start_main_~#t1605~0.offset=|v_ULTIMATE.start_main_~#t1605~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_22|, ~x$w_buff1~0=v_~x$w_buff1~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_27, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_22, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1605~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1605~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1606~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1606~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:04:12,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t1606~0.offset_10| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11|) |v_ULTIMATE.start_main_~#t1606~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1606~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1606~0.base_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1606~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1606~0.offset, ULTIMATE.start_main_~#t1606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:04:12,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~y~0_Out-51398138 1) (= ~x$r_buff1_thd1~0_Out-51398138 ~x$r_buff0_thd1~0_In-51398138) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-51398138)) (= ~x$r_buff0_thd0~0_In-51398138 ~x$r_buff1_thd0~0_Out-51398138) (= 1 ~x$r_buff0_thd1~0_Out-51398138) (= ~x$r_buff0_thd2~0_In-51398138 ~x$r_buff1_thd2~0_Out-51398138)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-51398138, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-51398138, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-51398138, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-51398138} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-51398138, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-51398138, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-51398138, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-51398138, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-51398138, ~y~0=~y~0_Out-51398138, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-51398138, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-51398138} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:04:12,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1369566036 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1369566036 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1369566036| ~x$w_buff0_used~0_In-1369566036)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1369566036| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1369566036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1369566036} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1369566036|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1369566036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1369566036} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:04:12,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-451655550 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-451655550 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-451655550 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-451655550 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-451655550|)) (and (= ~x$w_buff1_used~0_In-451655550 |P0Thread1of1ForFork0_#t~ite6_Out-451655550|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-451655550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-451655550, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-451655550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-451655550} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-451655550|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-451655550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-451655550, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-451655550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-451655550} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:04:12,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1789710244 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1789710244 256)))) (or (and (= ~x$r_buff0_thd1~0_In1789710244 ~x$r_buff0_thd1~0_Out1789710244) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd1~0_Out1789710244) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1789710244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1789710244} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1789710244, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1789710244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1789710244} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:04:12,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1676353749 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1676353749 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1676353749 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1676353749 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1676353749| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1676353749| ~x$r_buff1_thd1~0_In1676353749)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676353749, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676353749, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676353749, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676353749} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676353749, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1676353749|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676353749, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676353749, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676353749} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:04:12,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) 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|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:04:12,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd2~0_53 v_~x$r_buff0_thd2~0_52)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_21, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:04:12,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1052160076 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1052160076 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1052160076 256))) (.cse4 (= (mod ~x$r_buff1_thd2~0_In1052160076 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite30_Out1052160076| |P1Thread1of1ForFork1_#t~ite29_Out1052160076|)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1052160076 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1052160076| |P1Thread1of1ForFork1_#t~ite28_Out1052160076|) (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4)) (= ~x$r_buff1_thd2~0_In1052160076 |P1Thread1of1ForFork1_#t~ite29_Out1052160076|) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite29_In1052160076| |P1Thread1of1ForFork1_#t~ite29_Out1052160076|) (not .cse0) (= ~x$r_buff1_thd2~0_In1052160076 |P1Thread1of1ForFork1_#t~ite30_Out1052160076|)))) (let ((.cse6 (not .cse3))) (and .cse0 (not .cse1) (or .cse6 (not .cse2)) (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite28_Out1052160076| |P1Thread1of1ForFork1_#t~ite29_Out1052160076|) .cse5 (= |P1Thread1of1ForFork1_#t~ite28_Out1052160076| 0))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1052160076|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052160076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052160076, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052160076, ~weak$$choice2~0=~weak$$choice2~0_In1052160076, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1052160076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052160076} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1052160076|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1052160076|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052160076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052160076, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052160076, ~weak$$choice2~0=~weak$$choice2~0_In1052160076, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1052160076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052160076} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:04:12,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~x$mem_tmp~0_4 v_~x~0_16) (= 0 v_~x$flush_delayed~0_6) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:04:12,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In649734036 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In649734036 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out649734036| ~x~0_In649734036)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out649734036| ~x$w_buff1~0_In649734036)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In649734036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In649734036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In649734036, ~x~0=~x~0_In649734036} OutVars{~x$w_buff1~0=~x$w_buff1~0_In649734036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In649734036, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In649734036, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out649734036|, ~x~0=~x~0_In649734036} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:04:12,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~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|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:04:12,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In195480451 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In195480451 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out195480451| ~x$w_buff0_used~0_In195480451)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out195480451| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195480451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195480451} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out195480451|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195480451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195480451} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:04:12,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-239006138 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-239006138 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-239006138 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-239006138 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-239006138| ~x$w_buff1_used~0_In-239006138)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-239006138| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-239006138, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239006138, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239006138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239006138} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-239006138, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239006138, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-239006138|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239006138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239006138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:04:12,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1450204939 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1450204939 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1450204939| 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1450204939 |P1Thread1of1ForFork1_#t~ite36_Out1450204939|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1450204939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450204939} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1450204939, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1450204939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450204939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:04:12,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-4467791 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-4467791 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-4467791 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-4467791 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-4467791|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-4467791 |P1Thread1of1ForFork1_#t~ite37_Out-4467791|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-4467791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-4467791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-4467791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4467791} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-4467791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-4467791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-4467791, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-4467791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4467791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:04:12,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$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|, ~x$r_buff1_thd2~0=v_~x$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, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:04:12,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~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 07:04:12,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1211550655| |ULTIMATE.start_main_#t~ite40_Out-1211550655|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1211550655 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1211550655 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1211550655| ~x$w_buff1~0_In-1211550655) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out-1211550655| ~x~0_In-1211550655) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1211550655, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1211550655, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1211550655, ~x~0=~x~0_In-1211550655} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1211550655|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1211550655|, ~x$w_buff1~0=~x$w_buff1~0_In-1211550655, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1211550655, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1211550655, ~x~0=~x~0_In-1211550655} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:04:12,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2113581582 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2113581582 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2113581582|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2113581582 |ULTIMATE.start_main_#t~ite42_Out-2113581582|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2113581582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2113581582} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2113581582, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2113581582|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2113581582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:04:12,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In125024949 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In125024949 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In125024949 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In125024949 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out125024949|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In125024949 |ULTIMATE.start_main_#t~ite43_Out125024949|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In125024949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In125024949, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In125024949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In125024949} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In125024949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In125024949, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out125024949|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In125024949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In125024949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:04:12,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1229249043 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1229249043 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1229249043| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out1229249043| ~x$r_buff0_thd0~0_In1229249043) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1229249043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1229249043} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1229249043, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1229249043|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1229249043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:04:12,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1364321254 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1364321254 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1364321254 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1364321254 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1364321254|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1364321254| ~x$r_buff1_thd0~0_In-1364321254) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1364321254, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1364321254, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1364321254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1364321254} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1364321254, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1364321254, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1364321254, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1364321254|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1364321254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:04:12,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite45_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:04:12,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:04:12 BasicIcfg [2019-12-27 07:04:12,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:04:12,886 INFO L168 Benchmark]: Toolchain (without parser) took 11586.31 ms. Allocated memory was 145.8 MB in the beginning and 372.2 MB in the end (delta: 226.5 MB). Free memory was 100.9 MB in the beginning and 185.8 MB in the end (delta: -85.0 MB). Peak memory consumption was 141.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,887 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:04:12,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.74 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 154.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,891 INFO L168 Benchmark]: Boogie Preprocessor took 43.55 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,896 INFO L168 Benchmark]: RCFGBuilder took 817.49 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 108.1 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,897 INFO L168 Benchmark]: TraceAbstraction took 9835.95 ms. Allocated memory was 203.9 MB in the beginning and 372.2 MB in the end (delta: 168.3 MB). Free memory was 108.1 MB in the beginning and 185.8 MB in the end (delta: -77.7 MB). Peak memory consumption was 90.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:12,906 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.74 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 154.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.55 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.49 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 108.1 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9835.95 ms. Allocated memory was 203.9 MB in the beginning and 372.2 MB in the end (delta: 168.3 MB). Free memory was 108.1 MB in the beginning and 185.8 MB in the end (delta: -77.7 MB). Peak memory consumption was 90.6 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, 29 ConcurrentYvCompositions, 26 ChoiceCompositions, 4391 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49085 CheckedPairsTotal, 102 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(&t1605, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1606, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1646 SDtfs, 1195 SDslu, 2679 SDs, 0 SdLazy, 1572 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 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.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 2802 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 59223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...