/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:32:43,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:32:43,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:32:44,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:32:44,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:32:44,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:32:44,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:32:44,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:32:44,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:32:44,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:32:44,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:32:44,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:32:44,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:32:44,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:32:44,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:32:44,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:32:44,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:32:44,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:32:44,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:32:44,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:32:44,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:32:44,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:32:44,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:32:44,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:32:44,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:32:44,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:32:44,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:32:44,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:32:44,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:32:44,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:32:44,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:32:44,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:32:44,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:32:44,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:32:44,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:32:44,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:32:44,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:32:44,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:32:44,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:32:44,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:32:44,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:32:44,082 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-SemanticLbe.epf [2019-12-18 16:32:44,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:32:44,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:32:44,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:32:44,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:32:44,104 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:32:44,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:32:44,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:32:44,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:32:44,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:32:44,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:32:44,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:32:44,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:32:44,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:32:44,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:32:44,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:32:44,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:32:44,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:32:44,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:32:44,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:32:44,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:32:44,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:32:44,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:32:44,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:32:44,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:32:44,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:32:44,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:32:44,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:32:44,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:32:44,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:32:44,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:32:44,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:32:44,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:32:44,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:32:44,407 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:32:44,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 16:32:44,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da90f68a1/d1e14f6d48af47c58894699c2cc1716c/FLAG87daeec1b [2019-12-18 16:32:45,069 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:32:45,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 16:32:45,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da90f68a1/d1e14f6d48af47c58894699c2cc1716c/FLAG87daeec1b [2019-12-18 16:32:45,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da90f68a1/d1e14f6d48af47c58894699c2cc1716c [2019-12-18 16:32:45,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:32:45,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:32:45,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:32:45,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:32:45,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:32:45,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:32:45" (1/1) ... [2019-12-18 16:32:45,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417d8fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:45, skipping insertion in model container [2019-12-18 16:32:45,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:32:45" (1/1) ... [2019-12-18 16:32:45,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:32:45,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:32:45,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:32:46,017 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:32:46,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:32:46,178 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:32:46,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46 WrapperNode [2019-12-18 16:32:46,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:32:46,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:32:46,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:32:46,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:32:46,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:32:46,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:32:46,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:32:46,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:32:46,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (1/1) ... [2019-12-18 16:32:46,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:32:46,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:32:46,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:32:46,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:32:46,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (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 16:32:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:32:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:32:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:32:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:32:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:32:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:32:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:32:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:32:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:32:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:32:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:32:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:32:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:32:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:32:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:32:46,361 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 16:32:47,133 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:32:47,134 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:32:47,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:32:47 BoogieIcfgContainer [2019-12-18 16:32:47,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:32:47,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:32:47,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:32:47,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:32:47,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:32:45" (1/3) ... [2019-12-18 16:32:47,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230dc0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:32:47, skipping insertion in model container [2019-12-18 16:32:47,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:32:46" (2/3) ... [2019-12-18 16:32:47,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230dc0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:32:47, skipping insertion in model container [2019-12-18 16:32:47,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:32:47" (3/3) ... [2019-12-18 16:32:47,144 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-18 16:32:47,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:32:47,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:32:47,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:32:47,166 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:32:47,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,272 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,284 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,284 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,297 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:32:47,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:32:47,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:32:47,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:32:47,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:32:47,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:32:47,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:32:47,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:32:47,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:32:47,354 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:32:47,368 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 16:32:47,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 16:32:47,473 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 16:32:47,473 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:32:47,499 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:32:47,528 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 16:32:47,591 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 16:32:47,591 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:32:47,599 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:32:47,620 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:32:47,621 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:32:53,866 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-18 16:32:54,219 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 16:32:54,380 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 16:32:54,408 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-18 16:32:54,408 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:32:54,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-18 16:33:28,265 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-18 16:33:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-18 16:33:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:33:28,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:28,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:28,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-18 16:33:28,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:28,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881882713] [2019-12-18 16:33:28,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:28,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 16:33:28,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881882713] [2019-12-18 16:33:28,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:28,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:33:28,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154453552] [2019-12-18 16:33:28,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:33:28,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:33:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:28,548 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-18 16:33:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:33,056 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-18 16:33:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:33:33,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:33:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:33,874 INFO L225 Difference]: With dead ends: 158106 [2019-12-18 16:33:33,874 INFO L226 Difference]: Without dead ends: 149058 [2019-12-18 16:33:33,876 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 16:33:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-18 16:33:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-18 16:33:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-18 16:33:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-18 16:33:51,721 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-18 16:33:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:51,722 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-18 16:33:51,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:33:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-18 16:33:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:33:51,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:51,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:51,734 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:51,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-18 16:33:51,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:51,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372938279] [2019-12-18 16:33:51,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:51,910 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 16:33:51,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372938279] [2019-12-18 16:33:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:51,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:33:51,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238636801] [2019-12-18 16:33:51,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:33:51,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:33:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:51,914 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-18 16:33:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:54,737 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-18 16:33:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:33:54,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:33:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:02,930 INFO L225 Difference]: With dead ends: 235386 [2019-12-18 16:34:02,930 INFO L226 Difference]: Without dead ends: 235190 [2019-12-18 16:34:02,931 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 16:34:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-18 16:34:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-18 16:34:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-18 16:34:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-18 16:34:24,410 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-18 16:34:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:24,410 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-18 16:34:24,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:34:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-18 16:34:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:34:24,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:24,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:34:24,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-18 16:34:24,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:24,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800325975] [2019-12-18 16:34:24,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:24,493 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 16:34:24,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800325975] [2019-12-18 16:34:24,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:24,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:34:24,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098032395] [2019-12-18 16:34:24,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:34:24,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:34:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:34:24,498 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 3 states. [2019-12-18 16:34:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:25,178 INFO L93 Difference]: Finished difference Result 136511 states and 567133 transitions. [2019-12-18 16:34:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:34:25,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:34:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:25,725 INFO L225 Difference]: With dead ends: 136511 [2019-12-18 16:34:25,725 INFO L226 Difference]: Without dead ends: 136511 [2019-12-18 16:34:25,725 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 16:34:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136511 states. [2019-12-18 16:34:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136511 to 136511. [2019-12-18 16:34:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136511 states. [2019-12-18 16:34:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136511 states to 136511 states and 567133 transitions. [2019-12-18 16:34:42,070 INFO L78 Accepts]: Start accepts. Automaton has 136511 states and 567133 transitions. Word has length 15 [2019-12-18 16:34:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:42,070 INFO L462 AbstractCegarLoop]: Abstraction has 136511 states and 567133 transitions. [2019-12-18 16:34:42,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:34:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 136511 states and 567133 transitions. [2019-12-18 16:34:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:34:42,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:42,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:34:42,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1173494608, now seen corresponding path program 1 times [2019-12-18 16:34:42,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:42,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945001128] [2019-12-18 16:34:42,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:42,133 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 16:34:42,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945001128] [2019-12-18 16:34:42,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:42,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:34:42,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769844011] [2019-12-18 16:34:42,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:34:42,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:34:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:34:42,136 INFO L87 Difference]: Start difference. First operand 136511 states and 567133 transitions. Second operand 4 states. [2019-12-18 16:34:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:42,309 INFO L93 Difference]: Finished difference Result 37132 states and 130918 transitions. [2019-12-18 16:34:42,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:34:42,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:34:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:42,411 INFO L225 Difference]: With dead ends: 37132 [2019-12-18 16:34:42,412 INFO L226 Difference]: Without dead ends: 37132 [2019-12-18 16:34:42,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:34:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37132 states. [2019-12-18 16:34:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37132 to 37132. [2019-12-18 16:34:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37132 states. [2019-12-18 16:34:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37132 states to 37132 states and 130918 transitions. [2019-12-18 16:34:43,098 INFO L78 Accepts]: Start accepts. Automaton has 37132 states and 130918 transitions. Word has length 16 [2019-12-18 16:34:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:43,099 INFO L462 AbstractCegarLoop]: Abstraction has 37132 states and 130918 transitions. [2019-12-18 16:34:43,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:34:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 37132 states and 130918 transitions. [2019-12-18 16:34:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:34:43,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:43,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:34:43,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-18 16:34:43,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:43,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777724130] [2019-12-18 16:34:43,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:43,174 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 16:34:43,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777724130] [2019-12-18 16:34:43,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:43,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:34:43,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28982839] [2019-12-18 16:34:43,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:34:43,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:34:43,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:34:43,176 INFO L87 Difference]: Start difference. First operand 37132 states and 130918 transitions. Second operand 4 states. [2019-12-18 16:34:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:43,685 INFO L93 Difference]: Finished difference Result 47278 states and 165300 transitions. [2019-12-18 16:34:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:34:43,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:34:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:43,836 INFO L225 Difference]: With dead ends: 47278 [2019-12-18 16:34:43,836 INFO L226 Difference]: Without dead ends: 47267 [2019-12-18 16:34:43,836 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 16:34:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47267 states. [2019-12-18 16:34:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47267 to 41603. [2019-12-18 16:34:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41603 states. [2019-12-18 16:34:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 146400 transitions. [2019-12-18 16:34:47,237 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 146400 transitions. Word has length 16 [2019-12-18 16:34:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:47,237 INFO L462 AbstractCegarLoop]: Abstraction has 41603 states and 146400 transitions. [2019-12-18 16:34:47,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:34:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 146400 transitions. [2019-12-18 16:34:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:34:47,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:47,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:34:47,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-18 16:34:47,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:47,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613747921] [2019-12-18 16:34:47,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:47,379 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 16:34:47,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613747921] [2019-12-18 16:34:47,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:47,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:34:47,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073884610] [2019-12-18 16:34:47,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:34:47,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:34:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:34:47,382 INFO L87 Difference]: Start difference. First operand 41603 states and 146400 transitions. Second operand 5 states. [2019-12-18 16:34:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:48,022 INFO L93 Difference]: Finished difference Result 52097 states and 180773 transitions. [2019-12-18 16:34:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:34:48,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 16:34:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:48,127 INFO L225 Difference]: With dead ends: 52097 [2019-12-18 16:34:48,127 INFO L226 Difference]: Without dead ends: 52074 [2019-12-18 16:34:48,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:34:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52074 states. [2019-12-18 16:34:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52074 to 40948. [2019-12-18 16:34:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40948 states. [2019-12-18 16:34:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40948 states to 40948 states and 143892 transitions. [2019-12-18 16:34:49,328 INFO L78 Accepts]: Start accepts. Automaton has 40948 states and 143892 transitions. Word has length 24 [2019-12-18 16:34:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:49,329 INFO L462 AbstractCegarLoop]: Abstraction has 40948 states and 143892 transitions. [2019-12-18 16:34:49,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:34:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 40948 states and 143892 transitions. [2019-12-18 16:34:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:34:49,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:49,349 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 16:34:49,350 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2109697444, now seen corresponding path program 1 times [2019-12-18 16:34:49,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:49,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166621411] [2019-12-18 16:34:49,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:49,445 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 16:34:49,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166621411] [2019-12-18 16:34:49,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:49,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:34:49,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800675972] [2019-12-18 16:34:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:34:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:34:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:34:49,447 INFO L87 Difference]: Start difference. First operand 40948 states and 143892 transitions. Second operand 5 states. [2019-12-18 16:34:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:49,564 INFO L93 Difference]: Finished difference Result 20928 states and 74435 transitions. [2019-12-18 16:34:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:34:49,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:34:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:49,611 INFO L225 Difference]: With dead ends: 20928 [2019-12-18 16:34:49,611 INFO L226 Difference]: Without dead ends: 20928 [2019-12-18 16:34:49,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:34:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-18 16:34:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 20736. [2019-12-18 16:34:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20736 states. [2019-12-18 16:34:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20736 states to 20736 states and 73779 transitions. [2019-12-18 16:34:49,999 INFO L78 Accepts]: Start accepts. Automaton has 20736 states and 73779 transitions. Word has length 28 [2019-12-18 16:34:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:49,999 INFO L462 AbstractCegarLoop]: Abstraction has 20736 states and 73779 transitions. [2019-12-18 16:34:49,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:34:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 20736 states and 73779 transitions. [2019-12-18 16:34:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:34:50,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:50,035 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] [2019-12-18 16:34:50,036 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 708784038, now seen corresponding path program 1 times [2019-12-18 16:34:50,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:50,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830385830] [2019-12-18 16:34:50,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:50,124 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 16:34:50,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830385830] [2019-12-18 16:34:50,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:34:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45641995] [2019-12-18 16:34:50,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:34:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:34:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:34:50,128 INFO L87 Difference]: Start difference. First operand 20736 states and 73779 transitions. Second operand 4 states. [2019-12-18 16:34:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:50,720 INFO L93 Difference]: Finished difference Result 30054 states and 102106 transitions. [2019-12-18 16:34:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:34:50,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 16:34:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:50,781 INFO L225 Difference]: With dead ends: 30054 [2019-12-18 16:34:50,782 INFO L226 Difference]: Without dead ends: 21038 [2019-12-18 16:34:50,782 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 16:34:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21038 states. [2019-12-18 16:34:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21038 to 20942. [2019-12-18 16:34:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20942 states. [2019-12-18 16:34:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20942 states to 20942 states and 73630 transitions. [2019-12-18 16:34:51,190 INFO L78 Accepts]: Start accepts. Automaton has 20942 states and 73630 transitions. Word has length 42 [2019-12-18 16:34:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:51,191 INFO L462 AbstractCegarLoop]: Abstraction has 20942 states and 73630 transitions. [2019-12-18 16:34:51,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:34:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20942 states and 73630 transitions. [2019-12-18 16:34:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:34:51,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:51,226 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] [2019-12-18 16:34:51,226 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1622826474, now seen corresponding path program 2 times [2019-12-18 16:34:51,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:51,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229105154] [2019-12-18 16:34:51,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:51,326 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 16:34:51,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229105154] [2019-12-18 16:34:51,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:51,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:34:51,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090075071] [2019-12-18 16:34:51,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:34:51,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:34:51,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:34:51,330 INFO L87 Difference]: Start difference. First operand 20942 states and 73630 transitions. Second operand 5 states. [2019-12-18 16:34:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:52,030 INFO L93 Difference]: Finished difference Result 31343 states and 109184 transitions. [2019-12-18 16:34:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:34:52,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 16:34:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:52,098 INFO L225 Difference]: With dead ends: 31343 [2019-12-18 16:34:52,098 INFO L226 Difference]: Without dead ends: 31343 [2019-12-18 16:34:52,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 16:34:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-12-18 16:34:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 28179. [2019-12-18 16:34:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28179 states. [2019-12-18 16:34:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 98942 transitions. [2019-12-18 16:34:52,646 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 98942 transitions. Word has length 42 [2019-12-18 16:34:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:52,646 INFO L462 AbstractCegarLoop]: Abstraction has 28179 states and 98942 transitions. [2019-12-18 16:34:52,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:34:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 98942 transitions. [2019-12-18 16:34:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:34:52,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:52,686 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] [2019-12-18 16:34:52,686 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1262851908, now seen corresponding path program 3 times [2019-12-18 16:34:52,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:52,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845371800] [2019-12-18 16:34:52,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:53,027 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 16:34:53,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845371800] [2019-12-18 16:34:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:34:53,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341061476] [2019-12-18 16:34:53,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:34:53,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:34:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:34:53,030 INFO L87 Difference]: Start difference. First operand 28179 states and 98942 transitions. Second operand 6 states. [2019-12-18 16:34:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:53,166 INFO L93 Difference]: Finished difference Result 26793 states and 95440 transitions. [2019-12-18 16:34:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:34:53,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 16:34:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:53,214 INFO L225 Difference]: With dead ends: 26793 [2019-12-18 16:34:53,214 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 16:34:53,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:34:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 16:34:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 23427. [2019-12-18 16:34:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23427 states. [2019-12-18 16:34:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23427 states to 23427 states and 83180 transitions. [2019-12-18 16:34:53,634 INFO L78 Accepts]: Start accepts. Automaton has 23427 states and 83180 transitions. Word has length 42 [2019-12-18 16:34:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:53,635 INFO L462 AbstractCegarLoop]: Abstraction has 23427 states and 83180 transitions. [2019-12-18 16:34:53,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:34:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23427 states and 83180 transitions. [2019-12-18 16:34:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:34:53,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:53,673 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, 1, 1, 1, 1] [2019-12-18 16:34:53,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 712944392, now seen corresponding path program 1 times [2019-12-18 16:34:53,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:53,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921368914] [2019-12-18 16:34:53,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:53,750 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 16:34:53,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921368914] [2019-12-18 16:34:53,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:53,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:34:53,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982972898] [2019-12-18 16:34:53,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:34:53,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:34:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:34:53,753 INFO L87 Difference]: Start difference. First operand 23427 states and 83180 transitions. Second operand 4 states. [2019-12-18 16:34:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:53,920 INFO L93 Difference]: Finished difference Result 33565 states and 114667 transitions. [2019-12-18 16:34:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:34:53,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 16:34:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:53,938 INFO L225 Difference]: With dead ends: 33565 [2019-12-18 16:34:53,938 INFO L226 Difference]: Without dead ends: 10964 [2019-12-18 16:34:53,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:34:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2019-12-18 16:34:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10964. [2019-12-18 16:34:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10964 states. [2019-12-18 16:34:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 33801 transitions. [2019-12-18 16:34:54,104 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 33801 transitions. Word has length 57 [2019-12-18 16:34:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:54,104 INFO L462 AbstractCegarLoop]: Abstraction has 10964 states and 33801 transitions. [2019-12-18 16:34:54,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:34:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 33801 transitions. [2019-12-18 16:34:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:34:54,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:54,120 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, 1, 1, 1, 1] [2019-12-18 16:34:54,120 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 719186054, now seen corresponding path program 2 times [2019-12-18 16:34:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:54,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436324076] [2019-12-18 16:34:54,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:54,249 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 16:34:54,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436324076] [2019-12-18 16:34:54,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:54,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:34:54,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36705166] [2019-12-18 16:34:54,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:34:54,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:34:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:34:54,252 INFO L87 Difference]: Start difference. First operand 10964 states and 33801 transitions. Second operand 9 states. [2019-12-18 16:34:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:56,294 INFO L93 Difference]: Finished difference Result 80963 states and 252225 transitions. [2019-12-18 16:34:56,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 16:34:56,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:34:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:56,385 INFO L225 Difference]: With dead ends: 80963 [2019-12-18 16:34:56,385 INFO L226 Difference]: Without dead ends: 56302 [2019-12-18 16:34:56,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 16:34:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56302 states. [2019-12-18 16:34:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56302 to 13593. [2019-12-18 16:34:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13593 states. [2019-12-18 16:34:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 42350 transitions. [2019-12-18 16:34:56,916 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 42350 transitions. Word has length 57 [2019-12-18 16:34:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:56,917 INFO L462 AbstractCegarLoop]: Abstraction has 13593 states and 42350 transitions. [2019-12-18 16:34:56,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:34:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 42350 transitions. [2019-12-18 16:34:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:34:56,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:56,932 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, 1, 1, 1, 1] [2019-12-18 16:34:56,932 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1032821336, now seen corresponding path program 3 times [2019-12-18 16:34:56,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:56,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035749302] [2019-12-18 16:34:56,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:57,018 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 16:34:57,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035749302] [2019-12-18 16:34:57,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:57,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:34:57,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302390471] [2019-12-18 16:34:57,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:34:57,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:34:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:34:57,020 INFO L87 Difference]: Start difference. First operand 13593 states and 42350 transitions. Second operand 7 states. [2019-12-18 16:34:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:57,437 INFO L93 Difference]: Finished difference Result 35767 states and 109392 transitions. [2019-12-18 16:34:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:34:57,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:34:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:57,475 INFO L225 Difference]: With dead ends: 35767 [2019-12-18 16:34:57,475 INFO L226 Difference]: Without dead ends: 25000 [2019-12-18 16:34:57,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:34:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25000 states. [2019-12-18 16:34:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25000 to 16351. [2019-12-18 16:34:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16351 states. [2019-12-18 16:34:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16351 states to 16351 states and 50702 transitions. [2019-12-18 16:34:57,997 INFO L78 Accepts]: Start accepts. Automaton has 16351 states and 50702 transitions. Word has length 57 [2019-12-18 16:34:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:57,997 INFO L462 AbstractCegarLoop]: Abstraction has 16351 states and 50702 transitions. [2019-12-18 16:34:57,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:34:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16351 states and 50702 transitions. [2019-12-18 16:34:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:34:58,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:58,015 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, 1, 1, 1, 1] [2019-12-18 16:34:58,015 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:58,015 INFO L82 PathProgramCache]: Analyzing trace with hash 315127332, now seen corresponding path program 4 times [2019-12-18 16:34:58,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:58,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407886147] [2019-12-18 16:34:58,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:58,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 16:34:58,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407886147] [2019-12-18 16:34:58,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:58,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:34:58,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409650344] [2019-12-18 16:34:58,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:34:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:34:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:34:58,149 INFO L87 Difference]: Start difference. First operand 16351 states and 50702 transitions. Second operand 9 states. [2019-12-18 16:35:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:00,106 INFO L93 Difference]: Finished difference Result 95460 states and 296034 transitions. [2019-12-18 16:35:00,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 16:35:00,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 16:35:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:00,238 INFO L225 Difference]: With dead ends: 95460 [2019-12-18 16:35:00,238 INFO L226 Difference]: Without dead ends: 78835 [2019-12-18 16:35:00,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 16:35:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78835 states. [2019-12-18 16:35:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78835 to 21627. [2019-12-18 16:35:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21627 states. [2019-12-18 16:35:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21627 states to 21627 states and 67322 transitions. [2019-12-18 16:35:01,359 INFO L78 Accepts]: Start accepts. Automaton has 21627 states and 67322 transitions. Word has length 57 [2019-12-18 16:35:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:01,360 INFO L462 AbstractCegarLoop]: Abstraction has 21627 states and 67322 transitions. [2019-12-18 16:35:01,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:35:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21627 states and 67322 transitions. [2019-12-18 16:35:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:35:01,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:01,384 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, 1, 1, 1, 1] [2019-12-18 16:35:01,384 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash 57637352, now seen corresponding path program 5 times [2019-12-18 16:35:01,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:01,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818164697] [2019-12-18 16:35:01,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:01,464 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 16:35:01,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818164697] [2019-12-18 16:35:01,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:01,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:35:01,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655240276] [2019-12-18 16:35:01,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:35:01,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:01,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:35:01,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:35:01,466 INFO L87 Difference]: Start difference. First operand 21627 states and 67322 transitions. Second operand 7 states. [2019-12-18 16:35:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:02,019 INFO L93 Difference]: Finished difference Result 40740 states and 124618 transitions. [2019-12-18 16:35:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:35:02,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 16:35:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:02,117 INFO L225 Difference]: With dead ends: 40740 [2019-12-18 16:35:02,117 INFO L226 Difference]: Without dead ends: 35500 [2019-12-18 16:35:02,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:35:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35500 states. [2019-12-18 16:35:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35500 to 21867. [2019-12-18 16:35:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21867 states. [2019-12-18 16:35:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21867 states to 21867 states and 68068 transitions. [2019-12-18 16:35:02,842 INFO L78 Accepts]: Start accepts. Automaton has 21867 states and 68068 transitions. Word has length 57 [2019-12-18 16:35:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:02,843 INFO L462 AbstractCegarLoop]: Abstraction has 21867 states and 68068 transitions. [2019-12-18 16:35:02,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:35:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 21867 states and 68068 transitions. [2019-12-18 16:35:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 16:35:02,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:02,868 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, 1, 1, 1, 1] [2019-12-18 16:35:02,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 841823262, now seen corresponding path program 6 times [2019-12-18 16:35:02,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:02,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546257440] [2019-12-18 16:35:02,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:02,926 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 16:35:02,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546257440] [2019-12-18 16:35:02,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:02,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:35:02,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146198702] [2019-12-18 16:35:02,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:35:02,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:02,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:35:02,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:35:02,928 INFO L87 Difference]: Start difference. First operand 21867 states and 68068 transitions. Second operand 3 states. [2019-12-18 16:35:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:03,022 INFO L93 Difference]: Finished difference Result 19943 states and 60935 transitions. [2019-12-18 16:35:03,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:35:03,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 16:35:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:03,064 INFO L225 Difference]: With dead ends: 19943 [2019-12-18 16:35:03,065 INFO L226 Difference]: Without dead ends: 19943 [2019-12-18 16:35:03,065 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 16:35:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19943 states. [2019-12-18 16:35:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19943 to 19142. [2019-12-18 16:35:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19142 states. [2019-12-18 16:35:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19142 states to 19142 states and 58299 transitions. [2019-12-18 16:35:03,501 INFO L78 Accepts]: Start accepts. Automaton has 19142 states and 58299 transitions. Word has length 57 [2019-12-18 16:35:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:03,501 INFO L462 AbstractCegarLoop]: Abstraction has 19142 states and 58299 transitions. [2019-12-18 16:35:03,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:35:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 19142 states and 58299 transitions. [2019-12-18 16:35:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:03,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:03,531 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:03,531 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -531606549, now seen corresponding path program 1 times [2019-12-18 16:35:03,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:03,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563388177] [2019-12-18 16:35:03,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:03,643 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 16:35:03,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563388177] [2019-12-18 16:35:03,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:03,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:35:03,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797663380] [2019-12-18 16:35:03,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:35:03,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:35:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:35:03,646 INFO L87 Difference]: Start difference. First operand 19142 states and 58299 transitions. Second operand 9 states. [2019-12-18 16:35:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:05,043 INFO L93 Difference]: Finished difference Result 33710 states and 102184 transitions. [2019-12-18 16:35:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:35:05,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-18 16:35:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:05,083 INFO L225 Difference]: With dead ends: 33710 [2019-12-18 16:35:05,083 INFO L226 Difference]: Without dead ends: 26827 [2019-12-18 16:35:05,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:35:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2019-12-18 16:35:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 19493. [2019-12-18 16:35:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19493 states. [2019-12-18 16:35:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19493 states to 19493 states and 59099 transitions. [2019-12-18 16:35:05,430 INFO L78 Accepts]: Start accepts. Automaton has 19493 states and 59099 transitions. Word has length 58 [2019-12-18 16:35:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:05,430 INFO L462 AbstractCegarLoop]: Abstraction has 19493 states and 59099 transitions. [2019-12-18 16:35:05,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:35:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19493 states and 59099 transitions. [2019-12-18 16:35:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:05,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:05,452 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:05,453 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash -48042617, now seen corresponding path program 2 times [2019-12-18 16:35:05,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:05,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479765987] [2019-12-18 16:35:05,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:05,629 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 16:35:05,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479765987] [2019-12-18 16:35:05,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:05,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:35:05,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171396803] [2019-12-18 16:35:05,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:35:05,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:05,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:35:05,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:35:05,632 INFO L87 Difference]: Start difference. First operand 19493 states and 59099 transitions. Second operand 10 states. [2019-12-18 16:35:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:06,626 INFO L93 Difference]: Finished difference Result 36456 states and 109899 transitions. [2019-12-18 16:35:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:35:06,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 16:35:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:06,673 INFO L225 Difference]: With dead ends: 36456 [2019-12-18 16:35:06,673 INFO L226 Difference]: Without dead ends: 30289 [2019-12-18 16:35:06,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:35:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30289 states. [2019-12-18 16:35:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30289 to 19255. [2019-12-18 16:35:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2019-12-18 16:35:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 58219 transitions. [2019-12-18 16:35:07,050 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 58219 transitions. Word has length 58 [2019-12-18 16:35:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:07,051 INFO L462 AbstractCegarLoop]: Abstraction has 19255 states and 58219 transitions. [2019-12-18 16:35:07,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:35:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 58219 transitions. [2019-12-18 16:35:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:07,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:07,074 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:07,074 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -330235761, now seen corresponding path program 3 times [2019-12-18 16:35:07,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:07,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81935256] [2019-12-18 16:35:07,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:07,221 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 16:35:07,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81935256] [2019-12-18 16:35:07,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:07,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:35:07,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880055778] [2019-12-18 16:35:07,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:35:07,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:35:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:35:07,224 INFO L87 Difference]: Start difference. First operand 19255 states and 58219 transitions. Second operand 11 states. [2019-12-18 16:35:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:08,273 INFO L93 Difference]: Finished difference Result 32685 states and 98382 transitions. [2019-12-18 16:35:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:35:08,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:35:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:08,341 INFO L225 Difference]: With dead ends: 32685 [2019-12-18 16:35:08,342 INFO L226 Difference]: Without dead ends: 29705 [2019-12-18 16:35:08,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:35:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29705 states. [2019-12-18 16:35:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29705 to 19117. [2019-12-18 16:35:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19117 states. [2019-12-18 16:35:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19117 states to 19117 states and 57812 transitions. [2019-12-18 16:35:09,053 INFO L78 Accepts]: Start accepts. Automaton has 19117 states and 57812 transitions. Word has length 58 [2019-12-18 16:35:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:09,053 INFO L462 AbstractCegarLoop]: Abstraction has 19117 states and 57812 transitions. [2019-12-18 16:35:09,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:35:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19117 states and 57812 transitions. [2019-12-18 16:35:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:09,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:09,091 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:09,091 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash -969290591, now seen corresponding path program 4 times [2019-12-18 16:35:09,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:09,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187783411] [2019-12-18 16:35:09,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:09,673 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 16:35:09,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187783411] [2019-12-18 16:35:09,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:09,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:35:09,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699312251] [2019-12-18 16:35:09,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:35:09,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:35:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:35:09,675 INFO L87 Difference]: Start difference. First operand 19117 states and 57812 transitions. Second operand 17 states. [2019-12-18 16:35:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:13,455 INFO L93 Difference]: Finished difference Result 24817 states and 74303 transitions. [2019-12-18 16:35:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 16:35:13,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2019-12-18 16:35:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:13,493 INFO L225 Difference]: With dead ends: 24817 [2019-12-18 16:35:13,493 INFO L226 Difference]: Without dead ends: 24627 [2019-12-18 16:35:13,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 16:35:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24627 states. [2019-12-18 16:35:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24627 to 18977. [2019-12-18 16:35:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18977 states. [2019-12-18 16:35:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18977 states to 18977 states and 57439 transitions. [2019-12-18 16:35:13,904 INFO L78 Accepts]: Start accepts. Automaton has 18977 states and 57439 transitions. Word has length 58 [2019-12-18 16:35:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:13,904 INFO L462 AbstractCegarLoop]: Abstraction has 18977 states and 57439 transitions. [2019-12-18 16:35:13,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:35:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18977 states and 57439 transitions. [2019-12-18 16:35:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:13,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:13,927 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:13,927 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1796876869, now seen corresponding path program 5 times [2019-12-18 16:35:13,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:13,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72663889] [2019-12-18 16:35:13,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:35:14,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72663889] [2019-12-18 16:35:14,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:14,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:35:14,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951653510] [2019-12-18 16:35:14,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:35:14,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:35:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:35:14,102 INFO L87 Difference]: Start difference. First operand 18977 states and 57439 transitions. Second operand 10 states. [2019-12-18 16:35:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:17,358 INFO L93 Difference]: Finished difference Result 48139 states and 144009 transitions. [2019-12-18 16:35:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 16:35:17,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-18 16:35:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:17,432 INFO L225 Difference]: With dead ends: 48139 [2019-12-18 16:35:17,432 INFO L226 Difference]: Without dead ends: 47941 [2019-12-18 16:35:17,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 16:35:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47941 states. [2019-12-18 16:35:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47941 to 23562. [2019-12-18 16:35:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23562 states. [2019-12-18 16:35:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23562 states to 23562 states and 71598 transitions. [2019-12-18 16:35:18,203 INFO L78 Accepts]: Start accepts. Automaton has 23562 states and 71598 transitions. Word has length 58 [2019-12-18 16:35:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:18,203 INFO L462 AbstractCegarLoop]: Abstraction has 23562 states and 71598 transitions. [2019-12-18 16:35:18,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:35:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 23562 states and 71598 transitions. [2019-12-18 16:35:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:18,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:18,229 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:18,229 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1716009035, now seen corresponding path program 6 times [2019-12-18 16:35:18,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:18,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694552523] [2019-12-18 16:35:18,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:18,420 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 16:35:18,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694552523] [2019-12-18 16:35:18,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:18,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:35:18,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540411820] [2019-12-18 16:35:18,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:35:18,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:35:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:35:18,427 INFO L87 Difference]: Start difference. First operand 23562 states and 71598 transitions. Second operand 11 states. [2019-12-18 16:35:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:23,282 INFO L93 Difference]: Finished difference Result 65538 states and 193975 transitions. [2019-12-18 16:35:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 16:35:23,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:35:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:23,384 INFO L225 Difference]: With dead ends: 65538 [2019-12-18 16:35:23,384 INFO L226 Difference]: Without dead ends: 65538 [2019-12-18 16:35:23,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 16:35:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65538 states. [2019-12-18 16:35:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65538 to 25436. [2019-12-18 16:35:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25436 states. [2019-12-18 16:35:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25436 states to 25436 states and 77569 transitions. [2019-12-18 16:35:24,311 INFO L78 Accepts]: Start accepts. Automaton has 25436 states and 77569 transitions. Word has length 58 [2019-12-18 16:35:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 25436 states and 77569 transitions. [2019-12-18 16:35:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:35:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25436 states and 77569 transitions. [2019-12-18 16:35:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:24,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:24,344 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:24,344 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1389166229, now seen corresponding path program 7 times [2019-12-18 16:35:24,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:24,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959479238] [2019-12-18 16:35:24,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:24,593 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 16:35:24,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959479238] [2019-12-18 16:35:24,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:24,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:35:24,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792706607] [2019-12-18 16:35:24,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:35:24,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:35:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:35:24,596 INFO L87 Difference]: Start difference. First operand 25436 states and 77569 transitions. Second operand 11 states. [2019-12-18 16:35:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:28,622 INFO L93 Difference]: Finished difference Result 61027 states and 181332 transitions. [2019-12-18 16:35:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 16:35:28,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 16:35:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:28,717 INFO L225 Difference]: With dead ends: 61027 [2019-12-18 16:35:28,717 INFO L226 Difference]: Without dead ends: 61027 [2019-12-18 16:35:28,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 16:35:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61027 states. [2019-12-18 16:35:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61027 to 25190. [2019-12-18 16:35:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25190 states. [2019-12-18 16:35:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25190 states to 25190 states and 76704 transitions. [2019-12-18 16:35:29,603 INFO L78 Accepts]: Start accepts. Automaton has 25190 states and 76704 transitions. Word has length 58 [2019-12-18 16:35:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:29,603 INFO L462 AbstractCegarLoop]: Abstraction has 25190 states and 76704 transitions. [2019-12-18 16:35:29,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:35:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25190 states and 76704 transitions. [2019-12-18 16:35:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:35:29,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:29,634 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, 1, 1, 1, 1, 1] [2019-12-18 16:35:29,634 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -949890779, now seen corresponding path program 8 times [2019-12-18 16:35:29,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:29,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995447712] [2019-12-18 16:35:29,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:35:29,703 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 16:35:29,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995447712] [2019-12-18 16:35:29,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:35:29,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:35:29,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075743015] [2019-12-18 16:35:29,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:35:29,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:35:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:35:29,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:35:29,706 INFO L87 Difference]: Start difference. First operand 25190 states and 76704 transitions. Second operand 3 states. [2019-12-18 16:35:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:35:29,814 INFO L93 Difference]: Finished difference Result 25188 states and 76699 transitions. [2019-12-18 16:35:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:35:29,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 16:35:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:35:29,865 INFO L225 Difference]: With dead ends: 25188 [2019-12-18 16:35:29,865 INFO L226 Difference]: Without dead ends: 25188 [2019-12-18 16:35:29,866 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 16:35:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25188 states. [2019-12-18 16:35:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25188 to 23496. [2019-12-18 16:35:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23496 states. [2019-12-18 16:35:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23496 states to 23496 states and 72184 transitions. [2019-12-18 16:35:30,250 INFO L78 Accepts]: Start accepts. Automaton has 23496 states and 72184 transitions. Word has length 58 [2019-12-18 16:35:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:35:30,250 INFO L462 AbstractCegarLoop]: Abstraction has 23496 states and 72184 transitions. [2019-12-18 16:35:30,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:35:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23496 states and 72184 transitions. [2019-12-18 16:35:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:35:30,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:35:30,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:35:30,291 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:35:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:35:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 1 times [2019-12-18 16:35:30,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:35:30,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675521177] [2019-12-18 16:35:30,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:35:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:35:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:35:30,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:35:30,436 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:35:30,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~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_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:35:30,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-18 16:35:30,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-18 16:35:30,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= 1 ~y$w_buff0~0_Out-217273266) (= |P2Thread1of1ForFork3_#in~arg.base_In-217273266| P2Thread1of1ForFork3_~arg.base_Out-217273266) (= 1 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-217273266|) (= ~y$w_buff1_used~0_Out-217273266 ~y$w_buff0_used~0_In-217273266) (= ~y$w_buff0~0_In-217273266 ~y$w_buff1~0_Out-217273266) (= ~y$w_buff0_used~0_Out-217273266 1) (= P2Thread1of1ForFork3_~arg.offset_Out-217273266 |P2Thread1of1ForFork3_#in~arg.offset_In-217273266|) (= (mod ~y$w_buff1_used~0_Out-217273266 256) 0) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-217273266 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-217273266|)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-217273266, ~y$w_buff0~0=~y$w_buff0~0_In-217273266, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-217273266|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-217273266|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-217273266, ~y$w_buff1~0=~y$w_buff1~0_Out-217273266, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-217273266|, ~y$w_buff0~0=~y$w_buff0~0_Out-217273266, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out-217273266, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-217273266, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-217273266|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out-217273266, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-217273266|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-217273266} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:35:30,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-18 16:35:30,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~a~0_19 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:35:30,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-1068097559| |P3Thread1of1ForFork0_#t~ite32_Out-1068097559|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1068097559 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1068097559 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out-1068097559| ~y~0_In-1068097559) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1068097559 |P3Thread1of1ForFork0_#t~ite32_Out-1068097559|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1068097559, ~y$w_buff1~0=~y$w_buff1~0_In-1068097559, ~y~0=~y~0_In-1068097559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068097559} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1068097559, ~y$w_buff1~0=~y$w_buff1~0_In-1068097559, ~y~0=~y~0_In-1068097559, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1068097559|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1068097559|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068097559} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:35:30,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2070134712 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2070134712 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-2070134712| 0)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-2070134712| ~y$w_buff0_used~0_In-2070134712) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070134712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070134712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070134712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070134712, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-2070134712|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 16:35:30,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In858509382 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In858509382 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out858509382| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out858509382| ~y$w_buff0_used~0_In858509382) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In858509382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In858509382} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In858509382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In858509382, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out858509382|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 16:35:30,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In536309496 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In536309496 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In536309496 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In536309496 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out536309496| ~y$w_buff1_used~0_In536309496)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out536309496|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In536309496, ~y$w_buff0_used~0=~y$w_buff0_used~0_In536309496, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In536309496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In536309496} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In536309496, ~y$w_buff0_used~0=~y$w_buff0_used~0_In536309496, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In536309496, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out536309496|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In536309496} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 16:35:30,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1181587382 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In-1181587382| |P1Thread1of1ForFork2_#t~ite8_Out-1181587382|) (= ~y$w_buff0~0_In-1181587382 |P1Thread1of1ForFork2_#t~ite9_Out-1181587382|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1181587382 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1181587382 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1181587382 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1181587382 256)) .cse1))) (= ~y$w_buff0~0_In-1181587382 |P1Thread1of1ForFork2_#t~ite8_Out-1181587382|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1181587382| |P1Thread1of1ForFork2_#t~ite8_Out-1181587382|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1181587382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1181587382, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1181587382|, ~y$w_buff0~0=~y$w_buff0~0_In-1181587382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1181587382, ~weak$$choice2~0=~weak$$choice2~0_In-1181587382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1181587382} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1181587382, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1181587382|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1181587382, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1181587382|, ~y$w_buff0~0=~y$w_buff0~0_In-1181587382, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1181587382, ~weak$$choice2~0=~weak$$choice2~0_In-1181587382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1181587382} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 16:35:30,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-253575822 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-253575822 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-253575822 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out-253575822 ~y$r_buff0_thd3~0_In-253575822) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-253575822, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-253575822} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-253575822|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-253575822, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-253575822} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 16:35:30,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1770968794 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1770968794 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1770968794 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1770968794 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out1770968794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1770968794| ~y$r_buff1_thd3~0_In1770968794) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770968794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770968794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770968794} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770968794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770968794, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1770968794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770968794} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 16:35:30,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_57)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 16:35:30,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1280644344 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1280644344 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd4~0_In1280644344 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1280644344 256) 0))) (or (and (= ~y$w_buff1_used~0_In1280644344 |P3Thread1of1ForFork0_#t~ite35_Out1280644344|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out1280644344| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1280644344, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1280644344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280644344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280644344} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1280644344, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1280644344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280644344, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1280644344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280644344} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 16:35:30,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-102104763 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-102104763 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-102104763| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-102104763| ~y$r_buff0_thd4~0_In-102104763)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-102104763, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-102104763, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-102104763|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 16:35:30,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In-1289904625 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1289904625 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1289904625 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-1289904625 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-1289904625| 0)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-1289904625| ~y$r_buff1_thd4~0_In-1289904625) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1289904625, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1289904625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289904625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1289904625} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1289904625, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1289904625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289904625, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1289904625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1289904625} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 16:35:30,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#t~ite37_36| v_~y$r_buff1_thd4~0_55) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_35|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:35:30,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1309111617 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1309111617| ~y$w_buff1~0_In1309111617) (= |P1Thread1of1ForFork2_#t~ite11_In1309111617| |P1Thread1of1ForFork2_#t~ite11_Out1309111617|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1309111617 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1309111617 256)) (and (= (mod ~y$w_buff1_used~0_In1309111617 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1309111617 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite11_Out1309111617| |P1Thread1of1ForFork2_#t~ite12_Out1309111617|) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1309111617| ~y$w_buff1~0_In1309111617)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1309111617, ~y$w_buff1~0=~y$w_buff1~0_In1309111617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309111617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309111617, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1309111617|, ~weak$$choice2~0=~weak$$choice2~0_In1309111617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309111617} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1309111617, ~y$w_buff1~0=~y$w_buff1~0_In1309111617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309111617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309111617, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1309111617|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1309111617|, ~weak$$choice2~0=~weak$$choice2~0_In1309111617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309111617} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:35:30,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2065908462 256)))) (or (and (= ~y$w_buff0_used~0_In2065908462 |P1Thread1of1ForFork2_#t~ite15_Out2065908462|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In2065908462| |P1Thread1of1ForFork2_#t~ite14_Out2065908462|)) (and (= ~y$w_buff0_used~0_In2065908462 |P1Thread1of1ForFork2_#t~ite14_Out2065908462|) (= |P1Thread1of1ForFork2_#t~ite14_Out2065908462| |P1Thread1of1ForFork2_#t~ite15_Out2065908462|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2065908462 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In2065908462 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In2065908462 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2065908462 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065908462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065908462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065908462, ~weak$$choice2~0=~weak$$choice2~0_In2065908462, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In2065908462|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065908462} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065908462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065908462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065908462, ~weak$$choice2~0=~weak$$choice2~0_In2065908462, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2065908462|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out2065908462|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065908462} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 16:35:30,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:35:30,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1701431211 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1701431211| ~y$r_buff1_thd2~0_In-1701431211) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-1701431211| |P1Thread1of1ForFork2_#t~ite23_Out-1701431211|)) (and .cse0 (= ~y$r_buff1_thd2~0_In-1701431211 |P1Thread1of1ForFork2_#t~ite23_Out-1701431211|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1701431211| |P1Thread1of1ForFork2_#t~ite23_Out-1701431211|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1701431211 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1701431211 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1701431211 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1701431211 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1701431211, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701431211, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1701431211, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1701431211|, ~weak$$choice2~0=~weak$$choice2~0_In-1701431211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701431211} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1701431211, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701431211, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1701431211, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1701431211|, ~weak$$choice2~0=~weak$$choice2~0_In-1701431211, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1701431211|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701431211} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 16:35:30,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:35:30,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:35:30,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-192212989 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-192212989 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-192212989 |ULTIMATE.start_main_#t~ite42_Out-192212989|)) (and (= ~y$w_buff1~0_In-192212989 |ULTIMATE.start_main_#t~ite42_Out-192212989|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-192212989, ~y~0=~y~0_In-192212989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-192212989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-192212989} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-192212989, ~y~0=~y~0_In-192212989, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-192212989|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-192212989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-192212989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:35:30,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:35:30,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In489222260 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In489222260 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out489222260|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out489222260| ~y$w_buff0_used~0_In489222260)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In489222260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In489222260, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out489222260|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:35:30,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1515598709 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1515598709 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1515598709 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1515598709 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1515598709| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1515598709| ~y$w_buff1_used~0_In-1515598709) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1515598709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1515598709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1515598709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1515598709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1515598709, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1515598709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1515598709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:35:30,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In821819034 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In821819034 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out821819034|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In821819034 |ULTIMATE.start_main_#t~ite46_Out821819034|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In821819034, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In821819034} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In821819034, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In821819034, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out821819034|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:35:30,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1060791998 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1060791998 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1060791998 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1060791998 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1060791998 |ULTIMATE.start_main_#t~ite47_Out-1060791998|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1060791998|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060791998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1060791998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1060791998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060791998} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1060791998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1060791998, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1060791998|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1060791998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1060791998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:35:30,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31) (= v_~main$tmp_guard1~0_29 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:35:30,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:35:30 BasicIcfg [2019-12-18 16:35:30,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:35:30,567 INFO L168 Benchmark]: Toolchain (without parser) took 165230.45 ms. Allocated memory was 140.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,568 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.53 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 158.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,569 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,570 INFO L168 Benchmark]: RCFGBuilder took 857.35 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 103.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,571 INFO L168 Benchmark]: TraceAbstraction took 163429.05 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 16:35:30,573 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.53 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 158.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 155.4 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.87 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.35 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 103.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163429.05 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.0s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [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) [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)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [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_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 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 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 46.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5555 SDtfs, 9261 SDslu, 21013 SDs, 0 SdLazy, 15388 SolverSat, 574 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 71 SyntacticMatches, 14 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3923 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218838occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 71.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 297242 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1029 ConstructedInterpolants, 0 QuantifiedInterpolants, 223415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...