/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:30:33,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:30:33,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:30:33,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:30:33,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:30:33,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:30:33,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:30:33,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:30:33,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:30:33,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:30:33,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:30:33,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:30:33,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:30:33,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:30:33,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:30:33,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:30:33,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:30:33,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:30:33,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:30:33,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:30:33,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:30:33,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:30:33,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:30:33,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:30:33,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:30:33,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:30:33,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:30:33,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:30:33,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:30:33,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:30:33,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:30:33,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:30:33,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:30:33,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:30:33,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:30:33,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:30:33,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:30:33,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:30:33,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:30:33,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:30:33,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:30:33,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:30:33,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:30:33,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:30:33,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:30:33,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:30:33,169 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:30:33,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:30:33,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:30:33,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:30:33,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:30:33,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:30:33,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:30:33,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:30:33,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:30:33,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:30:33,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:30:33,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:30:33,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:30:33,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:30:33,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:30:33,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:30:33,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:30:33,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:30:33,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:30:33,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:30:33,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:30:33,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:30:33,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:30:33,175 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:30:33,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:30:33,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:30:33,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:30:33,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:30:33,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:30:33,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:30:33,458 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:30:33,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-18 22:30:33,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03d161f8/922c0b69055b4270b2a620614beb3c44/FLAG7fdcba87a [2019-12-18 22:30:34,112 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:30:34,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-18 22:30:34,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03d161f8/922c0b69055b4270b2a620614beb3c44/FLAG7fdcba87a [2019-12-18 22:30:34,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03d161f8/922c0b69055b4270b2a620614beb3c44 [2019-12-18 22:30:34,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:30:34,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:30:34,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:30:34,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:30:34,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:30:34,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:30:34" (1/1) ... [2019-12-18 22:30:34,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:34, skipping insertion in model container [2019-12-18 22:30:34,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:30:34" (1/1) ... [2019-12-18 22:30:34,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:30:34,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:30:35,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:30:35,112 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:30:35,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:30:35,255 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:30:35,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35 WrapperNode [2019-12-18 22:30:35,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:30:35,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:30:35,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:30:35,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:30:35,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:30:35,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:30:35,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:30:35,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:30:35,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (1/1) ... [2019-12-18 22:30:35,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:30:35,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:30:35,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:30:35,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:30:35,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (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 22:30:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:30:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:30:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:30:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:30:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:30:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:30:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:30:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:30:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:30:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:30:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:30:35,444 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 22:30:36,199 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:30:36,200 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:30:36,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:36 BoogieIcfgContainer [2019-12-18 22:30:36,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:30:36,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:30:36,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:30:36,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:30:36,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:30:34" (1/3) ... [2019-12-18 22:30:36,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950c041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:30:36, skipping insertion in model container [2019-12-18 22:30:36,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:30:35" (2/3) ... [2019-12-18 22:30:36,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1950c041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:30:36, skipping insertion in model container [2019-12-18 22:30:36,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:36" (3/3) ... [2019-12-18 22:30:36,213 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2019-12-18 22:30:36,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:30:36,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:30:36,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:30:36,236 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:30:36,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,288 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,288 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:30:36,340 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:30:36,360 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:30:36,360 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:30:36,360 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:30:36,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:30:36,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:30:36,361 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:30:36,361 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:30:36,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:30:36,377 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 22:30:36,380 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 22:30:36,466 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 22:30:36,466 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:30:36,484 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:30:36,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 22:30:36,585 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 22:30:36,585 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:30:36,593 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:30:36,611 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 22:30:36,612 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:30:39,096 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-18 22:30:39,541 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 22:30:39,652 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 22:30:39,680 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-18 22:30:39,680 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 22:30:39,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 22:30:40,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-18 22:30:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-18 22:30:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:30:40,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:40,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:30:40,281 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-18 22:30:40,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:40,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911829599] [2019-12-18 22:30:40,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:40,512 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 22:30:40,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911829599] [2019-12-18 22:30:40,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:40,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:30:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363368091] [2019-12-18 22:30:40,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:40,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:40,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:40,537 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-18 22:30:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:40,877 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-18 22:30:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:40,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:30:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:40,972 INFO L225 Difference]: With dead ends: 9432 [2019-12-18 22:30:40,973 INFO L226 Difference]: Without dead ends: 9250 [2019-12-18 22:30:40,975 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 22:30:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-18 22:30:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-18 22:30:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-18 22:30:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-18 22:30:41,522 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-18 22:30:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:41,523 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-18 22:30:41,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-18 22:30:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:30:41,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:41,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:41,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-18 22:30:41,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:41,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230903730] [2019-12-18 22:30:41,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:41,642 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 22:30:41,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230903730] [2019-12-18 22:30:41,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:41,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802181301] [2019-12-18 22:30:41,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:30:41,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:41,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:30:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:30:41,646 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-18 22:30:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:42,033 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-18 22:30:42,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:30:42,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:30:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:42,107 INFO L225 Difference]: With dead ends: 14408 [2019-12-18 22:30:42,107 INFO L226 Difference]: Without dead ends: 14401 [2019-12-18 22:30:42,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 22:30:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-18 22:30:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-18 22:30:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-18 22:30:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-18 22:30:43,219 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-18 22:30:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:43,220 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-18 22:30:43,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:30:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-18 22:30:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:30:43,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:43,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:43,236 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-18 22:30:43,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:43,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853902919] [2019-12-18 22:30:43,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:43,380 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 22:30:43,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853902919] [2019-12-18 22:30:43,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:43,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:43,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398383377] [2019-12-18 22:30:43,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:30:43,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:30:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:30:43,384 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-18 22:30:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:43,664 INFO L93 Difference]: Finished difference Result 16164 states and 50739 transitions. [2019-12-18 22:30:43,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:30:43,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:30:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:43,725 INFO L225 Difference]: With dead ends: 16164 [2019-12-18 22:30:43,726 INFO L226 Difference]: Without dead ends: 16164 [2019-12-18 22:30:43,726 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 22:30:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2019-12-18 22:30:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 14464. [2019-12-18 22:30:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2019-12-18 22:30:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 45803 transitions. [2019-12-18 22:30:44,315 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 45803 transitions. Word has length 11 [2019-12-18 22:30:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:44,316 INFO L462 AbstractCegarLoop]: Abstraction has 14464 states and 45803 transitions. [2019-12-18 22:30:44,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:30:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 45803 transitions. [2019-12-18 22:30:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:30:44,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:44,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:44,321 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1340562840, now seen corresponding path program 1 times [2019-12-18 22:30:44,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:44,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78373015] [2019-12-18 22:30:44,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:44,397 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 22:30:44,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78373015] [2019-12-18 22:30:44,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:44,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:44,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398087050] [2019-12-18 22:30:44,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:44,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:44,399 INFO L87 Difference]: Start difference. First operand 14464 states and 45803 transitions. Second operand 5 states. [2019-12-18 22:30:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:44,895 INFO L93 Difference]: Finished difference Result 19369 states and 59796 transitions. [2019-12-18 22:30:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:30:44,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 22:30:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:44,951 INFO L225 Difference]: With dead ends: 19369 [2019-12-18 22:30:44,952 INFO L226 Difference]: Without dead ends: 19362 [2019-12-18 22:30:44,952 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 22:30:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19362 states. [2019-12-18 22:30:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19362 to 14438. [2019-12-18 22:30:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-18 22:30:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45411 transitions. [2019-12-18 22:30:45,580 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45411 transitions. Word has length 17 [2019-12-18 22:30:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:45,580 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45411 transitions. [2019-12-18 22:30:45,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45411 transitions. [2019-12-18 22:30:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:30:45,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:45,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:45,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1840046616, now seen corresponding path program 1 times [2019-12-18 22:30:45,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:45,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204447880] [2019-12-18 22:30:45,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:45,654 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 22:30:45,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204447880] [2019-12-18 22:30:45,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:45,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:45,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194412541] [2019-12-18 22:30:45,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:45,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:45,656 INFO L87 Difference]: Start difference. First operand 14438 states and 45411 transitions. Second operand 3 states. [2019-12-18 22:30:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:45,769 INFO L93 Difference]: Finished difference Result 17602 states and 54691 transitions. [2019-12-18 22:30:45,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:45,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 22:30:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:45,809 INFO L225 Difference]: With dead ends: 17602 [2019-12-18 22:30:45,810 INFO L226 Difference]: Without dead ends: 17602 [2019-12-18 22:30:45,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-12-18 22:30:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 15582. [2019-12-18 22:30:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15582 states. [2019-12-18 22:30:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 48928 transitions. [2019-12-18 22:30:46,906 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 48928 transitions. Word has length 25 [2019-12-18 22:30:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:46,907 INFO L462 AbstractCegarLoop]: Abstraction has 15582 states and 48928 transitions. [2019-12-18 22:30:46,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 48928 transitions. [2019-12-18 22:30:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:30:46,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:46,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:46,923 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1840202205, now seen corresponding path program 1 times [2019-12-18 22:30:46,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:46,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710323755] [2019-12-18 22:30:46,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:47,002 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 22:30:47,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710323755] [2019-12-18 22:30:47,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:47,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:30:47,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526053177] [2019-12-18 22:30:47,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:30:47,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:30:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:30:47,006 INFO L87 Difference]: Start difference. First operand 15582 states and 48928 transitions. Second operand 4 states. [2019-12-18 22:30:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:47,040 INFO L93 Difference]: Finished difference Result 2444 states and 5542 transitions. [2019-12-18 22:30:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:30:47,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:30:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:47,044 INFO L225 Difference]: With dead ends: 2444 [2019-12-18 22:30:47,044 INFO L226 Difference]: Without dead ends: 2145 [2019-12-18 22:30:47,045 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 22:30:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-18 22:30:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2019-12-18 22:30:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-18 22:30:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-18 22:30:47,082 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 25 [2019-12-18 22:30:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:47,082 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-18 22:30:47,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:30:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-18 22:30:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:30:47,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:47,086 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] [2019-12-18 22:30:47,086 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-18 22:30:47,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:47,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895119297] [2019-12-18 22:30:47,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:47,243 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 22:30:47,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895119297] [2019-12-18 22:30:47,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:47,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:30:47,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369424229] [2019-12-18 22:30:47,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:47,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:47,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:47,246 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-18 22:30:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:47,286 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-18 22:30:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:30:47,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:30:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:47,287 INFO L225 Difference]: With dead ends: 443 [2019-12-18 22:30:47,287 INFO L226 Difference]: Without dead ends: 372 [2019-12-18 22:30:47,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:30:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-18 22:30:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-18 22:30:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 22:30:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-18 22:30:47,296 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-18 22:30:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:47,298 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-18 22:30:47,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-18 22:30:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:30:47,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:47,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:47,302 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-18 22:30:47,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:47,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084104809] [2019-12-18 22:30:47,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:47,395 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 22:30:47,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084104809] [2019-12-18 22:30:47,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:47,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:47,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188860943] [2019-12-18 22:30:47,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:47,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:47,397 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 3 states. [2019-12-18 22:30:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:47,409 INFO L93 Difference]: Finished difference Result 332 states and 584 transitions. [2019-12-18 22:30:47,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:47,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 22:30:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:47,410 INFO L225 Difference]: With dead ends: 332 [2019-12-18 22:30:47,410 INFO L226 Difference]: Without dead ends: 332 [2019-12-18 22:30:47,411 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 22:30:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-18 22:30:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-12-18 22:30:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 22:30:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-18 22:30:47,417 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-18 22:30:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:47,418 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-18 22:30:47,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-18 22:30:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 22:30:47,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:47,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:47,420 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-18 22:30:47,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:47,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624801519] [2019-12-18 22:30:47,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:47,546 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 22:30:47,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624801519] [2019-12-18 22:30:47,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:47,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:30:47,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486615644] [2019-12-18 22:30:47,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:30:47,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:30:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:30:47,548 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-18 22:30:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:47,756 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-18 22:30:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:30:47,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 22:30:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:47,758 INFO L225 Difference]: With dead ends: 488 [2019-12-18 22:30:47,758 INFO L226 Difference]: Without dead ends: 488 [2019-12-18 22:30:47,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-18 22:30:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-18 22:30:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 22:30:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-18 22:30:47,765 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-18 22:30:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:47,765 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-18 22:30:47,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-18 22:30:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 22:30:47,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:47,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:47,767 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-18 22:30:47,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:47,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192699584] [2019-12-18 22:30:47,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:47,871 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 22:30:47,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192699584] [2019-12-18 22:30:47,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:47,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:47,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705412040] [2019-12-18 22:30:47,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:47,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:47,874 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-18 22:30:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:48,004 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-18 22:30:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:48,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 22:30:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:48,005 INFO L225 Difference]: With dead ends: 423 [2019-12-18 22:30:48,005 INFO L226 Difference]: Without dead ends: 423 [2019-12-18 22:30:48,007 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 22:30:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-18 22:30:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-18 22:30:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 22:30:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-18 22:30:48,012 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-18 22:30:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:48,012 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-18 22:30:48,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-18 22:30:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:48,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:48,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] [2019-12-18 22:30:48,015 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-18 22:30:48,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:48,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001923597] [2019-12-18 22:30:48,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:48,283 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 22:30:48,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001923597] [2019-12-18 22:30:48,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:48,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:30:48,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418447132] [2019-12-18 22:30:48,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:30:48,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:30:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:30:48,285 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 13 states. [2019-12-18 22:30:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:49,017 INFO L93 Difference]: Finished difference Result 821 states and 1400 transitions. [2019-12-18 22:30:49,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:30:49,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 22:30:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:49,019 INFO L225 Difference]: With dead ends: 821 [2019-12-18 22:30:49,019 INFO L226 Difference]: Without dead ends: 273 [2019-12-18 22:30:49,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:30:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-18 22:30:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2019-12-18 22:30:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 22:30:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-18 22:30:49,024 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-18 22:30:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:49,024 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-18 22:30:49,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-18 22:30:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:49,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:49,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:49,025 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-18 22:30:49,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:49,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942090213] [2019-12-18 22:30:49,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:49,425 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 22:30:49,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942090213] [2019-12-18 22:30:49,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:49,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:30:49,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649262155] [2019-12-18 22:30:49,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 22:30:49,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 22:30:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:30:49,427 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 17 states. [2019-12-18 22:30:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:50,603 INFO L93 Difference]: Finished difference Result 514 states and 887 transitions. [2019-12-18 22:30:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:30:50,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-18 22:30:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:50,604 INFO L225 Difference]: With dead ends: 514 [2019-12-18 22:30:50,605 INFO L226 Difference]: Without dead ends: 480 [2019-12-18 22:30:50,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:30:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-18 22:30:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 332. [2019-12-18 22:30:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 22:30:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-18 22:30:50,611 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 54 [2019-12-18 22:30:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:50,612 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-18 22:30:50,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 22:30:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-18 22:30:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:50,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:50,613 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] [2019-12-18 22:30:50,613 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1446676572, now seen corresponding path program 3 times [2019-12-18 22:30:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384763220] [2019-12-18 22:30:50,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:50,884 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 22:30:50,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384763220] [2019-12-18 22:30:50,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:50,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:30:50,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018961769] [2019-12-18 22:30:50,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:30:50,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:30:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:30:50,891 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 15 states. [2019-12-18 22:30:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:51,485 INFO L93 Difference]: Finished difference Result 595 states and 999 transitions. [2019-12-18 22:30:51,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:30:51,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 22:30:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:51,487 INFO L225 Difference]: With dead ends: 595 [2019-12-18 22:30:51,487 INFO L226 Difference]: Without dead ends: 561 [2019-12-18 22:30:51,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:30:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-12-18 22:30:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 341. [2019-12-18 22:30:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 22:30:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 601 transitions. [2019-12-18 22:30:51,493 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 601 transitions. Word has length 54 [2019-12-18 22:30:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:51,493 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 601 transitions. [2019-12-18 22:30:51,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:30:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 601 transitions. [2019-12-18 22:30:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:51,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:51,494 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] [2019-12-18 22:30:51,495 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1203117294, now seen corresponding path program 4 times [2019-12-18 22:30:51,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:51,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012247346] [2019-12-18 22:30:51,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:51,954 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 22:30:51,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012247346] [2019-12-18 22:30:51,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:51,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:30:51,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728337409] [2019-12-18 22:30:51,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:30:51,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:30:51,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:30:51,957 INFO L87 Difference]: Start difference. First operand 341 states and 601 transitions. Second operand 15 states. [2019-12-18 22:30:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:52,705 INFO L93 Difference]: Finished difference Result 569 states and 956 transitions. [2019-12-18 22:30:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:30:52,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 22:30:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:52,707 INFO L225 Difference]: With dead ends: 569 [2019-12-18 22:30:52,707 INFO L226 Difference]: Without dead ends: 535 [2019-12-18 22:30:52,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:30:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-18 22:30:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 347. [2019-12-18 22:30:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-18 22:30:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 613 transitions. [2019-12-18 22:30:52,714 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 613 transitions. Word has length 54 [2019-12-18 22:30:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:52,714 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 613 transitions. [2019-12-18 22:30:52,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:30:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 613 transitions. [2019-12-18 22:30:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:52,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:52,716 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] [2019-12-18 22:30:52,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash 206557574, now seen corresponding path program 5 times [2019-12-18 22:30:52,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:52,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500663530] [2019-12-18 22:30:52,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:52,916 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 22:30:52,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500663530] [2019-12-18 22:30:52,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:52,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:30:52,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758549663] [2019-12-18 22:30:52,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:30:52,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:30:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:30:52,918 INFO L87 Difference]: Start difference. First operand 347 states and 613 transitions. Second operand 12 states. [2019-12-18 22:30:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:53,351 INFO L93 Difference]: Finished difference Result 526 states and 888 transitions. [2019-12-18 22:30:53,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:30:53,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 22:30:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:53,353 INFO L225 Difference]: With dead ends: 526 [2019-12-18 22:30:53,353 INFO L226 Difference]: Without dead ends: 492 [2019-12-18 22:30:53,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:30:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-12-18 22:30:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 328. [2019-12-18 22:30:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 22:30:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 575 transitions. [2019-12-18 22:30:53,361 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 575 transitions. Word has length 54 [2019-12-18 22:30:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:53,361 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 575 transitions. [2019-12-18 22:30:53,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:30:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 575 transitions. [2019-12-18 22:30:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:53,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:53,362 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] [2019-12-18 22:30:53,363 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash 932780242, now seen corresponding path program 6 times [2019-12-18 22:30:53,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:53,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482599643] [2019-12-18 22:30:53,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:53,601 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 22:30:53,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482599643] [2019-12-18 22:30:53,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:53,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:30:53,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512456985] [2019-12-18 22:30:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:30:53,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:30:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:30:53,603 INFO L87 Difference]: Start difference. First operand 328 states and 575 transitions. Second operand 12 states. [2019-12-18 22:30:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:53,857 INFO L93 Difference]: Finished difference Result 432 states and 731 transitions. [2019-12-18 22:30:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:30:53,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 22:30:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:53,857 INFO L225 Difference]: With dead ends: 432 [2019-12-18 22:30:53,858 INFO L226 Difference]: Without dead ends: 398 [2019-12-18 22:30:53,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:30:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-18 22:30:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 330. [2019-12-18 22:30:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-18 22:30:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-18 22:30:53,863 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-18 22:30:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:53,863 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-18 22:30:53,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:30:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-18 22:30:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:30:53,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:53,866 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] [2019-12-18 22:30:53,867 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 7 times [2019-12-18 22:30:53,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:53,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704094233] [2019-12-18 22:30:53,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:54,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:30:54,011 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:30:54,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24| 1)) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2011~0.base_24| 4) |v_#length_11|) (= v_~y~0_29 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2011~0.base_24|) (= 0 v_~y$r_buff1_thd0~0_50) (= |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2011~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2011~0.base_24|) |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0)) |v_#memory_int_9|) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, ULTIMATE.start_main_~#t2011~0.base=|v_ULTIMATE.start_main_~#t2011~0.base_24|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~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_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_20|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_~#t2011~0.offset=|v_ULTIMATE.start_main_~#t2011~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2011~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2012~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2012~0.base, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2011~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:30:54,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) |v_ULTIMATE.start_main_~#t2012~0.offset_10| 1)) |v_#memory_int_7|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2012~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2012~0.base_11| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2012~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_11|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2012~0.base, ULTIMATE.start_main_~#t2012~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 22:30:54,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:30:54,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-292010353 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-292010353 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-292010353| ~y~0_In-292010353) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-292010353| ~y$w_buff1~0_In-292010353)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-292010353, ~y$w_buff1~0=~y$w_buff1~0_In-292010353, ~y~0=~y~0_In-292010353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-292010353} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-292010353, ~y$w_buff1~0=~y$w_buff1~0_In-292010353, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-292010353|, ~y~0=~y~0_In-292010353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-292010353} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:30:54,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 22:30:54,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1546009506 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1546009506 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1546009506 |P1Thread1of1ForFork1_#t~ite11_Out1546009506|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1546009506| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1546009506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1546009506} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1546009506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1546009506, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1546009506|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:30:54,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1374742950 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1374742950 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1374742950 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1374742950 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1374742950 |P1Thread1of1ForFork1_#t~ite12_Out1374742950|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1374742950| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1374742950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1374742950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1374742950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1374742950} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1374742950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1374742950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1374742950, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1374742950|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1374742950} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:30:54,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1577864900 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1577864900 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1577864900|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1577864900 |P1Thread1of1ForFork1_#t~ite13_Out1577864900|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1577864900, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577864900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1577864900, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1577864900, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1577864900|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:30:54,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In539463299 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In539463299 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In539463299 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In539463299 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out539463299| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out539463299| ~y$r_buff1_thd2~0_In539463299) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In539463299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In539463299, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In539463299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539463299} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In539463299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In539463299, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In539463299, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out539463299|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539463299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:30:54,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:30:54,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1417444630 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1417444630 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1417444630| ~y$w_buff0_used~0_In1417444630) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1417444630|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1417444630, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1417444630} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1417444630|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1417444630, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1417444630} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:30:54,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1449103308 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1449103308 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1449103308 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1449103308 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1449103308|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1449103308 |P0Thread1of1ForFork0_#t~ite6_Out-1449103308|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1449103308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449103308, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1449103308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449103308} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1449103308|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1449103308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449103308, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1449103308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449103308} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:30:54,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1089049455 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1089049455 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out1089049455) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In1089049455 ~y$r_buff0_thd1~0_Out1089049455) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1089049455, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1089049455} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1089049455, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1089049455|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1089049455} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:54,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In2134144348 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2134144348 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In2134144348 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2134144348 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2134144348| ~y$r_buff1_thd1~0_In2134144348) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out2134144348| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2134144348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134144348, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2134144348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2134144348} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2134144348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134144348, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2134144348|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2134144348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2134144348} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:30:54,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:30:54,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:30:54,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1545275397 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1545275397 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out1545275397| |ULTIMATE.start_main_#t~ite18_Out1545275397|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite17_Out1545275397| ~y$w_buff1~0_In1545275397)) (and (= |ULTIMATE.start_main_#t~ite17_Out1545275397| ~y~0_In1545275397) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1545275397, ~y~0=~y~0_In1545275397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1545275397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545275397} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1545275397|, ~y$w_buff1~0=~y$w_buff1~0_In1545275397, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1545275397|, ~y~0=~y~0_In1545275397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1545275397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545275397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 22:30:54,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1915437390 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1915437390 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1915437390 |ULTIMATE.start_main_#t~ite19_Out1915437390|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1915437390| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1915437390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915437390} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1915437390, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1915437390|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915437390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 22:30:54,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In593297520 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In593297520 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In593297520 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In593297520 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out593297520| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out593297520| ~y$w_buff1_used~0_In593297520)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In593297520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In593297520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In593297520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In593297520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In593297520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In593297520, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out593297520|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In593297520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In593297520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 22:30:54,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1877354806 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1877354806 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1877354806|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1877354806 |ULTIMATE.start_main_#t~ite21_Out1877354806|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1877354806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877354806} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1877354806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1877354806, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1877354806|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 22:30:54,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1331259579 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1331259579 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1331259579 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1331259579 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1331259579| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out1331259579| ~y$r_buff1_thd0~0_In1331259579)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1331259579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331259579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1331259579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331259579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1331259579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331259579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1331259579, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1331259579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331259579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 22:30:54,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-467550349 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-467550349| ~y$w_buff1~0_In-467550349) (= |ULTIMATE.start_main_#t~ite31_Out-467550349| |ULTIMATE.start_main_#t~ite32_Out-467550349|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-467550349 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-467550349 256))) (= (mod ~y$w_buff0_used~0_In-467550349 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-467550349 256) 0)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite31_In-467550349| |ULTIMATE.start_main_#t~ite31_Out-467550349|) (= |ULTIMATE.start_main_#t~ite32_Out-467550349| ~y$w_buff1~0_In-467550349)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-467550349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-467550349, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-467550349, ~weak$$choice2~0=~weak$$choice2~0_In-467550349, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-467550349|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-467550349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467550349} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-467550349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-467550349, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-467550349, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-467550349|, ~weak$$choice2~0=~weak$$choice2~0_In-467550349, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-467550349|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-467550349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467550349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 22:30:54,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 22:30:54,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:30:54,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:30:54,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:30:54 BasicIcfg [2019-12-18 22:30:54,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:30:54,134 INFO L168 Benchmark]: Toolchain (without parser) took 19718.97 ms. Allocated memory was 145.8 MB in the beginning and 810.0 MB in the end (delta: 664.3 MB). Free memory was 101.9 MB in the beginning and 576.5 MB in the end (delta: -474.6 MB). Peak memory consumption was 189.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,135 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.54 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.12 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,137 INFO L168 Benchmark]: Boogie Preprocessor took 37.02 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,137 INFO L168 Benchmark]: RCFGBuilder took 840.83 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 108.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,138 INFO L168 Benchmark]: TraceAbstraction took 17929.20 ms. Allocated memory was 203.4 MB in the beginning and 810.0 MB in the end (delta: 606.6 MB). Free memory was 107.5 MB in the beginning and 576.5 MB in the end (delta: -469.0 MB). Peak memory consumption was 137.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:54,141 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.54 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.12 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.02 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.83 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 108.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17929.20 ms. Allocated memory was 203.4 MB in the beginning and 810.0 MB in the end (delta: 606.6 MB). Free memory was 107.5 MB in the beginning and 576.5 MB in the end (delta: -469.0 MB). Peak memory consumption was 137.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1706 SDtfs, 1993 SDslu, 6058 SDs, 0 SdLazy, 3702 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15582occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 10907 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 168362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...