/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/mix022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:42:37,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:42:37,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:42:37,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:42:37,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:42:37,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:42:37,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:42:37,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:42:37,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:42:37,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:42:37,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:42:37,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:42:37,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:42:37,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:42:37,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:42:37,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:42:37,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:42:37,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:42:37,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:42:37,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:42:37,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:42:37,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:42:37,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:42:37,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:42:37,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:42:37,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:42:37,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:42:37,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:42:37,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:42:37,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:42:37,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:42:37,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:42:37,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:42:37,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:42:37,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:42:37,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:42:37,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:42:37,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:42:37,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:42:37,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:42:37,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:42:37,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:42:37,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:42:37,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:42:37,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:42:37,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:42:37,077 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:42:37,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:42:37,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:42:37,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:42:37,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:42:37,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:42:37,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:42:37,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:42:37,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:42:37,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:42:37,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:42:37,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:42:37,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:42:37,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:42:37,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:42:37,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:42:37,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:42:37,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:42:37,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:42:37,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:42:37,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:42:37,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:42:37,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:42:37,082 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:42:37,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:42:37,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:42:37,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:42:37,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:42:37,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:42:37,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:42:37,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:42:37,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-18 20:42:37,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae3f6350/0256467b39a049fbb80c511ccccf0b95/FLAG381e3fe49 [2019-12-18 20:42:38,014 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:42:38,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-18 20:42:38,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae3f6350/0256467b39a049fbb80c511ccccf0b95/FLAG381e3fe49 [2019-12-18 20:42:38,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae3f6350/0256467b39a049fbb80c511ccccf0b95 [2019-12-18 20:42:38,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:42:38,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:42:38,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:42:38,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:42:38,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:42:38,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:42:38" (1/1) ... [2019-12-18 20:42:38,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad26e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:38, skipping insertion in model container [2019-12-18 20:42:38,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:42:38" (1/1) ... [2019-12-18 20:42:38,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:42:38,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:42:38,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:42:38,999 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:42:39,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:42:39,164 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:42:39,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39 WrapperNode [2019-12-18 20:42:39,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:42:39,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:42:39,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:42:39,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:42:39,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:42:39,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:42:39,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:42:39,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:42:39,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... [2019-12-18 20:42:39,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:42:39,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:42:39,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:42:39,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:42:39,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:42:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:42:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:42:39,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:42:39,350 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:42:40,023 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:42:40,023 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:42:40,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:42:40 BoogieIcfgContainer [2019-12-18 20:42:40,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:42:40,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:42:40,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:42:40,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:42:40,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:42:38" (1/3) ... [2019-12-18 20:42:40,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d64810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:42:40, skipping insertion in model container [2019-12-18 20:42:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:42:39" (2/3) ... [2019-12-18 20:42:40,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d64810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:42:40, skipping insertion in model container [2019-12-18 20:42:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:42:40" (3/3) ... [2019-12-18 20:42:40,034 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-18 20:42:40,045 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:42:40,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:42:40,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:42:40,057 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:42:40,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,113 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,113 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:42:40,187 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:42:40,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:42:40,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:42:40,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:42:40,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:42:40,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:42:40,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:42:40,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:42:40,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:42:40,230 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 20:42:40,232 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:42:40,353 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:42:40,354 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:42:40,372 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:42:40,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:42:40,467 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:42:40,467 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:42:40,476 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:42:40,494 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:42:40,495 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:42:43,803 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 20:42:43,906 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:42:43,929 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-18 20:42:43,930 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 20:42:43,933 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-18 20:42:44,444 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-18 20:42:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-18 20:42:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:42:44,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:44,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:42:44,456 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-18 20:42:44,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:44,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198707664] [2019-12-18 20:42:44,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:44,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198707664] [2019-12-18 20:42:44,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:44,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:42:44,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385260776] [2019-12-18 20:42:44,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:44,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:44,706 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-18 20:42:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:45,027 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-18 20:42:45,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:45,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:42:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:45,125 INFO L225 Difference]: With dead ends: 9196 [2019-12-18 20:42:45,125 INFO L226 Difference]: Without dead ends: 8650 [2019-12-18 20:42:45,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-18 20:42:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-18 20:42:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-18 20:42:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-18 20:42:45,645 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-18 20:42:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:45,645 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-18 20:42:45,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-18 20:42:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:42:45,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:45,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:45,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:45,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-18 20:42:45,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:45,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064991723] [2019-12-18 20:42:45,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:45,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064991723] [2019-12-18 20:42:45,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:45,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:45,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661003817] [2019-12-18 20:42:45,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:45,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:45,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:45,808 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-18 20:42:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:46,305 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-18 20:42:46,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:46,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:42:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:46,392 INFO L225 Difference]: With dead ends: 13062 [2019-12-18 20:42:46,392 INFO L226 Difference]: Without dead ends: 13055 [2019-12-18 20:42:46,395 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-18 20:42:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-18 20:42:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-18 20:42:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-18 20:42:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-18 20:42:46,904 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-18 20:42:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:46,905 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-18 20:42:46,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:42:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-18 20:42:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:42:46,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:46,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:46,911 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-18 20:42:46,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:46,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319871997] [2019-12-18 20:42:46,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:47,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319871997] [2019-12-18 20:42:47,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:47,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:47,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512133330] [2019-12-18 20:42:47,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:47,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:47,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:47,042 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-18 20:42:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:47,309 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-18 20:42:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:47,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:42:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:47,367 INFO L225 Difference]: With dead ends: 13877 [2019-12-18 20:42:47,368 INFO L226 Difference]: Without dead ends: 13877 [2019-12-18 20:42:47,368 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-18 20:42:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-18 20:42:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-18 20:42:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-18 20:42:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-18 20:42:48,417 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-18 20:42:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:48,418 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-18 20:42:48,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:42:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-18 20:42:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:42:48,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:48,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:48,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-18 20:42:48,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:48,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911600902] [2019-12-18 20:42:48,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:48,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911600902] [2019-12-18 20:42:48,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:48,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:42:48,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267353730] [2019-12-18 20:42:48,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:48,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:48,470 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-18 20:42:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:48,528 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-18 20:42:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:48,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:42:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:48,565 INFO L225 Difference]: With dead ends: 12386 [2019-12-18 20:42:48,565 INFO L226 Difference]: Without dead ends: 12386 [2019-12-18 20:42:48,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-18 20:42:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-18 20:42:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-18 20:42:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-18 20:42:49,055 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-18 20:42:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:49,055 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-18 20:42:49,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-18 20:42:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 20:42:49,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:49,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:49,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-18 20:42:49,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:49,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027042706] [2019-12-18 20:42:49,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:49,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027042706] [2019-12-18 20:42:49,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:49,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:42:49,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494863333] [2019-12-18 20:42:49,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:49,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:49,223 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-18 20:42:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:49,284 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-18 20:42:49,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:42:49,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 20:42:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:49,291 INFO L225 Difference]: With dead ends: 2361 [2019-12-18 20:42:49,292 INFO L226 Difference]: Without dead ends: 1670 [2019-12-18 20:42:49,292 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-18 20:42:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-18 20:42:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-18 20:42:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 20:42:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-18 20:42:49,337 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-18 20:42:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:49,337 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-18 20:42:49,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:42:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-18 20:42:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:42:49,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:49,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:49,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-18 20:42:49,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:49,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223062034] [2019-12-18 20:42:49,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:49,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223062034] [2019-12-18 20:42:49,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:49,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:42:49,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19875605] [2019-12-18 20:42:49,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:42:49,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:42:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:42:49,488 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-18 20:42:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:50,173 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-18 20:42:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:42:50,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:42:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:50,182 INFO L225 Difference]: With dead ends: 4552 [2019-12-18 20:42:50,182 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 20:42:50,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:42:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 20:42:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-18 20:42:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-18 20:42:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-18 20:42:50,309 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-18 20:42:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:50,310 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-18 20:42:50,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:42:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-18 20:42:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:42:50,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:50,315 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-18 20:42:50,316 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-18 20:42:50,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:50,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887739265] [2019-12-18 20:42:50,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:50,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887739265] [2019-12-18 20:42:50,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:50,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:50,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870307086] [2019-12-18 20:42:50,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:50,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:50,400 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 3 states. [2019-12-18 20:42:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:50,419 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-18 20:42:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:50,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:42:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:50,425 INFO L225 Difference]: With dead ends: 3872 [2019-12-18 20:42:50,426 INFO L226 Difference]: Without dead ends: 2030 [2019-12-18 20:42:50,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-18 20:42:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-18 20:42:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-18 20:42:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-18 20:42:50,460 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-18 20:42:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:50,460 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-18 20:42:50,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-18 20:42:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:42:50,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:50,464 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-18 20:42:50,464 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-18 20:42:50,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:50,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557086218] [2019-12-18 20:42:50,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:50,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557086218] [2019-12-18 20:42:50,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:50,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:42:50,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048807552] [2019-12-18 20:42:50,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:42:50,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:42:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:42:50,550 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-18 20:42:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:50,982 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-18 20:42:50,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:42:50,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 20:42:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:50,988 INFO L225 Difference]: With dead ends: 3736 [2019-12-18 20:42:50,988 INFO L226 Difference]: Without dead ends: 3707 [2019-12-18 20:42:50,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:42:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-18 20:42:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-18 20:42:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-18 20:42:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-18 20:42:51,032 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-18 20:42:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:51,032 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-18 20:42:51,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:42:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-18 20:42:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:42:51,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:51,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:51,036 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:51,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:51,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-18 20:42:51,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:51,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692057432] [2019-12-18 20:42:51,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:51,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692057432] [2019-12-18 20:42:51,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:51,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:42:51,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343800293] [2019-12-18 20:42:51,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:42:51,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:42:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:42:51,166 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 5 states. [2019-12-18 20:42:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:51,685 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-18 20:42:51,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:42:51,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:42:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:51,690 INFO L225 Difference]: With dead ends: 2989 [2019-12-18 20:42:51,690 INFO L226 Difference]: Without dead ends: 2989 [2019-12-18 20:42:51,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:42:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-18 20:42:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-18 20:42:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-18 20:42:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-18 20:42:51,733 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-18 20:42:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:51,733 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-18 20:42:51,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:42:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-18 20:42:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:42:51,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:51,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:42:51,738 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-18 20:42:51,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:51,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129137108] [2019-12-18 20:42:51,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:51,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129137108] [2019-12-18 20:42:51,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:51,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:42:51,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015175358] [2019-12-18 20:42:51,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:42:51,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:42:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:42:51,823 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 5 states. [2019-12-18 20:42:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:51,884 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-18 20:42:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:51,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:42:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:51,887 INFO L225 Difference]: With dead ends: 1549 [2019-12-18 20:42:51,888 INFO L226 Difference]: Without dead ends: 1302 [2019-12-18 20:42:51,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:42:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-18 20:42:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-18 20:42:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-18 20:42:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-18 20:42:51,914 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-18 20:42:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:51,915 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-18 20:42:51,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:42:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-18 20:42:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:42:51,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:51,920 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-18 20:42:51,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-18 20:42:51,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:51,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554249783] [2019-12-18 20:42:51,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:52,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554249783] [2019-12-18 20:42:52,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:52,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:42:52,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534913984] [2019-12-18 20:42:52,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:42:52,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:42:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:42:52,040 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 7 states. [2019-12-18 20:42:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:52,322 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-18 20:42:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:42:52,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:42:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:52,325 INFO L225 Difference]: With dead ends: 2115 [2019-12-18 20:42:52,325 INFO L226 Difference]: Without dead ends: 1423 [2019-12-18 20:42:52,325 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-18 20:42:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-18 20:42:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-18 20:42:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 20:42:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-18 20:42:52,344 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-18 20:42:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:52,346 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-18 20:42:52,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:42:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-18 20:42:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:42:52,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:52,352 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-18 20:42:52,352 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-18 20:42:52,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:52,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682456584] [2019-12-18 20:42:52,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:52,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682456584] [2019-12-18 20:42:52,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:52,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:42:52,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044914592] [2019-12-18 20:42:52,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:42:52,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:42:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:42:52,537 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 7 states. [2019-12-18 20:42:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:53,813 INFO L93 Difference]: Finished difference Result 2567 states and 5315 transitions. [2019-12-18 20:42:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:42:53,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:42:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:53,818 INFO L225 Difference]: With dead ends: 2567 [2019-12-18 20:42:53,818 INFO L226 Difference]: Without dead ends: 2567 [2019-12-18 20:42:53,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:42:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2019-12-18 20:42:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 1287. [2019-12-18 20:42:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-12-18 20:42:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2769 transitions. [2019-12-18 20:42:53,838 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2769 transitions. Word has length 51 [2019-12-18 20:42:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:53,838 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2769 transitions. [2019-12-18 20:42:53,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:42:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2769 transitions. [2019-12-18 20:42:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:42:53,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:53,841 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-18 20:42:53,841 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1716241888, now seen corresponding path program 3 times [2019-12-18 20:42:53,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:53,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054710219] [2019-12-18 20:42:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:53,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054710219] [2019-12-18 20:42:53,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550971826] [2019-12-18 20:42:53,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:53,943 INFO L87 Difference]: Start difference. First operand 1287 states and 2769 transitions. Second operand 3 states. [2019-12-18 20:42:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:53,999 INFO L93 Difference]: Finished difference Result 1642 states and 3493 transitions. [2019-12-18 20:42:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:54,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:42:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:54,004 INFO L225 Difference]: With dead ends: 1642 [2019-12-18 20:42:54,005 INFO L226 Difference]: Without dead ends: 1642 [2019-12-18 20:42:54,005 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-18 20:42:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-12-18 20:42:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1271. [2019-12-18 20:42:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-18 20:42:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2729 transitions. [2019-12-18 20:42:54,021 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2729 transitions. Word has length 51 [2019-12-18 20:42:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:54,022 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 2729 transitions. [2019-12-18 20:42:54,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2729 transitions. [2019-12-18 20:42:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:42:54,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:54,025 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-18 20:42:54,025 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:54,026 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-18 20:42:54,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:54,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11057817] [2019-12-18 20:42:54,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:54,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11057817] [2019-12-18 20:42:54,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:54,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:42:54,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826865507] [2019-12-18 20:42:54,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:42:54,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:42:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:42:54,235 INFO L87 Difference]: Start difference. First operand 1271 states and 2729 transitions. Second operand 10 states. [2019-12-18 20:42:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:56,044 INFO L93 Difference]: Finished difference Result 2523 states and 5246 transitions. [2019-12-18 20:42:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:42:56,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-18 20:42:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:56,048 INFO L225 Difference]: With dead ends: 2523 [2019-12-18 20:42:56,048 INFO L226 Difference]: Without dead ends: 2523 [2019-12-18 20:42:56,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:42:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2019-12-18 20:42:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 1330. [2019-12-18 20:42:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-12-18 20:42:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2847 transitions. [2019-12-18 20:42:56,070 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 2847 transitions. Word has length 52 [2019-12-18 20:42:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:56,070 INFO L462 AbstractCegarLoop]: Abstraction has 1330 states and 2847 transitions. [2019-12-18 20:42:56,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:42:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2847 transitions. [2019-12-18 20:42:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:42:56,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:56,073 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-18 20:42:56,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-18 20:42:56,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:56,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239744512] [2019-12-18 20:42:56,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239744512] [2019-12-18 20:42:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:56,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:42:56,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698031569] [2019-12-18 20:42:56,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:42:56,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:42:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:42:56,149 INFO L87 Difference]: Start difference. First operand 1330 states and 2847 transitions. Second operand 4 states. [2019-12-18 20:42:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:56,388 INFO L93 Difference]: Finished difference Result 2038 states and 4360 transitions. [2019-12-18 20:42:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:42:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 20:42:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:56,392 INFO L225 Difference]: With dead ends: 2038 [2019-12-18 20:42:56,392 INFO L226 Difference]: Without dead ends: 2038 [2019-12-18 20:42:56,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-18 20:42:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-12-18 20:42:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1372. [2019-12-18 20:42:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-12-18 20:42:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2945 transitions. [2019-12-18 20:42:56,410 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2945 transitions. Word has length 52 [2019-12-18 20:42:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:56,410 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 2945 transitions. [2019-12-18 20:42:56,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:42:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2945 transitions. [2019-12-18 20:42:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:42:56,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:56,412 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-18 20:42:56,413 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-18 20:42:56,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:56,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289928007] [2019-12-18 20:42:56,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:42:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:42:56,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289928007] [2019-12-18 20:42:56,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:42:56,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:42:56,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829687675] [2019-12-18 20:42:56,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:42:56,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:42:56,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:42:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:56,530 INFO L87 Difference]: Start difference. First operand 1372 states and 2945 transitions. Second operand 3 states. [2019-12-18 20:42:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:42:56,543 INFO L93 Difference]: Finished difference Result 1371 states and 2943 transitions. [2019-12-18 20:42:56,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:42:56,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:42:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:42:56,545 INFO L225 Difference]: With dead ends: 1371 [2019-12-18 20:42:56,545 INFO L226 Difference]: Without dead ends: 1371 [2019-12-18 20:42:56,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:42:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-18 20:42:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 935. [2019-12-18 20:42:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-18 20:42:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-18 20:42:56,561 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-18 20:42:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:42:56,561 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-18 20:42:56,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:42:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-18 20:42:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:42:56,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:42:56,564 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-18 20:42:56,564 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:42:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:42:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-18 20:42:56,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:42:56,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399847754] [2019-12-18 20:42:56,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:42:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:42:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:42:56,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:42:56,748 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:42:56,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t587~0.base_22| 4)) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t587~0.offset_17| 0) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22|)) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22| 1)) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22|) |v_ULTIMATE.start_main_~#t587~0.offset_17| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_22|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_17|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:42:56,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:42:56,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:42:56,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In719498732 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In719498732 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out719498732| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out719498732| ~y$w_buff0_used~0_In719498732) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In719498732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In719498732} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out719498732|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In719498732, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In719498732} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:42:56,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In790533902 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In790533902 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In790533902 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In790533902 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out790533902| ~y$w_buff1_used~0_In790533902) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out790533902| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In790533902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In790533902, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In790533902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In790533902} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out790533902|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In790533902, ~y$w_buff0_used~0=~y$w_buff0_used~0_In790533902, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In790533902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In790533902} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:42:56,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1552422246 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1552422246 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1552422246 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1552422246 ~y$r_buff0_thd1~0_In1552422246)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1552422246, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1552422246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1552422246, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1552422246|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1552422246} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:42:56,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1622951095 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1622951095| |P1Thread1of1ForFork1_#t~ite15_Out1622951095|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1622951095 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1622951095 256)) (and (= (mod ~y$r_buff1_thd2~0_In1622951095 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In1622951095 256) 0) .cse1))) (= ~y$w_buff0~0_In1622951095 |P1Thread1of1ForFork1_#t~ite14_Out1622951095|)) (and (= ~y$w_buff0~0_In1622951095 |P1Thread1of1ForFork1_#t~ite15_Out1622951095|) (= |P1Thread1of1ForFork1_#t~ite14_In1622951095| |P1Thread1of1ForFork1_#t~ite14_Out1622951095|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1622951095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1622951095, ~y$w_buff0~0=~y$w_buff0~0_In1622951095, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1622951095, ~weak$$choice2~0=~weak$$choice2~0_In1622951095, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1622951095|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622951095} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1622951095, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1622951095, ~y$w_buff0~0=~y$w_buff0~0_In1622951095, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1622951095, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1622951095|, ~weak$$choice2~0=~weak$$choice2~0_In1622951095, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1622951095|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622951095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 20:42:56,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-222345113 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out-222345113| |P1Thread1of1ForFork1_#t~ite18_Out-222345113|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-222345113 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-222345113 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-222345113 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-222345113 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite17_Out-222345113| ~y$w_buff1~0_In-222345113)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-222345113| ~y$w_buff1~0_In-222345113) (= |P1Thread1of1ForFork1_#t~ite17_In-222345113| |P1Thread1of1ForFork1_#t~ite17_Out-222345113|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-222345113, ~y$w_buff1~0=~y$w_buff1~0_In-222345113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-222345113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-222345113, ~weak$$choice2~0=~weak$$choice2~0_In-222345113, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-222345113|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222345113} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-222345113, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-222345113|, ~y$w_buff1~0=~y$w_buff1~0_In-222345113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-222345113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-222345113, ~weak$$choice2~0=~weak$$choice2~0_In-222345113, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-222345113|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222345113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:42:56,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1878089550 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1878089550| ~y$w_buff0_used~0_In1878089550) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1878089550 256)))) (or (= (mod ~y$w_buff0_used~0_In1878089550 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1878089550 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1878089550 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out1878089550| |P1Thread1of1ForFork1_#t~ite21_Out1878089550|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In1878089550| |P1Thread1of1ForFork1_#t~ite20_Out1878089550|) (= |P1Thread1of1ForFork1_#t~ite21_Out1878089550| ~y$w_buff0_used~0_In1878089550)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1878089550, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1878089550, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1878089550|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878089550, ~weak$$choice2~0=~weak$$choice2~0_In1878089550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878089550} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1878089550, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1878089550, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1878089550|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878089550, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1878089550|, ~weak$$choice2~0=~weak$$choice2~0_In1878089550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878089550} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:42:56,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:42:56,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1954322512 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1954322512| ~y$r_buff1_thd2~0_In1954322512) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1954322512| |P1Thread1of1ForFork1_#t~ite29_Out1954322512|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1954322512 256)))) (or (= (mod ~y$w_buff0_used~0_In1954322512 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1954322512 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1954322512 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out1954322512| ~y$r_buff1_thd2~0_In1954322512) (= |P1Thread1of1ForFork1_#t~ite30_Out1954322512| |P1Thread1of1ForFork1_#t~ite29_Out1954322512|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1954322512, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1954322512|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1954322512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1954322512, ~weak$$choice2~0=~weak$$choice2~0_In1954322512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954322512} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1954322512, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1954322512|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1954322512|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1954322512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1954322512, ~weak$$choice2~0=~weak$$choice2~0_In1954322512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954322512} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 20:42:56,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1819114813 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1819114813 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1819114813 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1819114813 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1819114813| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1819114813| ~y$r_buff1_thd1~0_In1819114813)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1819114813, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1819114813, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1819114813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1819114813} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1819114813, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1819114813, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1819114813|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1819114813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1819114813} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:42:56,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 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_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, 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_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:42:56,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:42:56,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1610613722 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1610613722 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1610613722 |P1Thread1of1ForFork1_#t~ite32_Out1610613722|)) (and (= ~y~0_In1610613722 |P1Thread1of1ForFork1_#t~ite32_Out1610613722|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1610613722, ~y$w_buff1~0=~y$w_buff1~0_In1610613722, ~y~0=~y~0_In1610613722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1610613722} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1610613722, ~y$w_buff1~0=~y$w_buff1~0_In1610613722, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1610613722|, ~y~0=~y~0_In1610613722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1610613722} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:42:56,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |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|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 20:42:56,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1868182449 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1868182449 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1868182449|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1868182449 |P1Thread1of1ForFork1_#t~ite34_Out-1868182449|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1868182449, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1868182449} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1868182449, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1868182449, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1868182449|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:42:56,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In510059136 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In510059136 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In510059136 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In510059136 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out510059136| ~y$w_buff1_used~0_In510059136) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite35_Out510059136| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In510059136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In510059136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In510059136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In510059136} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In510059136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In510059136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In510059136, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out510059136|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In510059136} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:42:56,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1919445552 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1919445552 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1919445552 |P1Thread1of1ForFork1_#t~ite36_Out1919445552|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1919445552|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1919445552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1919445552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1919445552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1919445552, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1919445552|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:42:56,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In11903504 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In11903504 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In11903504 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In11903504 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out11903504| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out11903504| ~y$r_buff1_thd2~0_In11903504) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In11903504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11903504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In11903504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11903504} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In11903504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In11903504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In11903504, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out11903504|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In11903504} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:42:56,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |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{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__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[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:42:56,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:42:56,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In318613617 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In318613617 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out318613617| ~y$w_buff1~0_In318613617) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out318613617| ~y~0_In318613617)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In318613617, ~y~0=~y~0_In318613617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318613617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318613617} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out318613617|, ~y$w_buff1~0=~y$w_buff1~0_In318613617, ~y~0=~y~0_In318613617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318613617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318613617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:42:56,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 20:42:56,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1504037250 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1504037250 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1504037250 |ULTIMATE.start_main_#t~ite42_Out1504037250|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1504037250|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1504037250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1504037250} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1504037250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1504037250, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1504037250|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:42:56,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-160466849 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-160466849 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-160466849 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-160466849 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-160466849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out-160466849| ~y$w_buff1_used~0_In-160466849)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-160466849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160466849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160466849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160466849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-160466849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160466849, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-160466849|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160466849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160466849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:42:56,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-57863175 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-57863175 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-57863175 |ULTIMATE.start_main_#t~ite44_Out-57863175|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-57863175|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-57863175, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-57863175} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-57863175, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-57863175, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-57863175|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:42:56,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In698128850 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In698128850 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In698128850 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In698128850 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out698128850|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In698128850 |ULTIMATE.start_main_#t~ite45_Out698128850|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In698128850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In698128850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In698128850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698128850} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In698128850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In698128850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In698128850, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out698128850|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698128850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:42:56,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:42:56,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:42:56 BasicIcfg [2019-12-18 20:42:56,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:42:56,829 INFO L168 Benchmark]: Toolchain (without parser) took 18511.31 ms. Allocated memory was 145.2 MB in the beginning and 706.7 MB in the end (delta: 561.5 MB). Free memory was 101.6 MB in the beginning and 270.4 MB in the end (delta: -168.8 MB). Peak memory consumption was 392.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,830 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.89 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.57 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,832 INFO L168 Benchmark]: Boogie Preprocessor took 39.19 ms. Allocated memory is still 202.9 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,832 INFO L168 Benchmark]: RCFGBuilder took 749.80 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 108.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,833 INFO L168 Benchmark]: TraceAbstraction took 16801.50 ms. Allocated memory was 202.9 MB in the beginning and 706.7 MB in the end (delta: 503.8 MB). Free memory was 107.3 MB in the beginning and 270.4 MB in the end (delta: -163.1 MB). Peak memory consumption was 340.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:42:56,837 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.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.89 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.57 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.19 ms. Allocated memory is still 202.9 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.80 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 108.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16801.50 ms. Allocated memory was 202.9 MB in the beginning and 706.7 MB in the end (delta: 503.8 MB). Free memory was 107.3 MB in the beginning and 270.4 MB in the end (delta: -163.1 MB). Peak memory consumption was 340.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2175 SDtfs, 2510 SDslu, 4161 SDs, 0 SdLazy, 3802 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 11612 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 65260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...