/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/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:07:33,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:07:33,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:07:33,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:07:33,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:07:33,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:07:33,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:07:33,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:07:33,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:07:33,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:07:33,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:07:33,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:07:33,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:07:33,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:07:33,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:07:33,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:07:33,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:07:33,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:07:33,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:07:33,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:07:33,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:07:33,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:07:33,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:07:33,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:07:33,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:07:33,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:07:33,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:07:33,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:07:33,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:07:33,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:07:33,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:07:33,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:07:33,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:07:33,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:07:33,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:07:33,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:07:33,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:07:33,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:07:33,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:07:33,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:07:33,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:07:33,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:07:33,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:07:33,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:07:33,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:07:33,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:07:33,299 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:07:33,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:07:33,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:07:33,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:07:33,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:07:33,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:07:33,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:07:33,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:07:33,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:07:33,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:07:33,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:07:33,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:07:33,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:07:33,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:07:33,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:07:33,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:07:33,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:07:33,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:07:33,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:07:33,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:07:33,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:07:33,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:07:33,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:07:33,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:07:33,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:07:33,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:07:33,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:07:33,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:07:33,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:07:33,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:07:33,613 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:07:33,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 08:07:33,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03d1a4fd/70347f7dea4a4f5f86950390fe5e9bf4/FLAG88b13a48d [2019-12-27 08:07:34,222 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:07:34,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 08:07:34,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03d1a4fd/70347f7dea4a4f5f86950390fe5e9bf4/FLAG88b13a48d [2019-12-27 08:07:34,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03d1a4fd/70347f7dea4a4f5f86950390fe5e9bf4 [2019-12-27 08:07:34,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:07:34,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:07:34,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:34,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:07:34,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:07:34,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:34" (1/1) ... [2019-12-27 08:07:34,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:34, skipping insertion in model container [2019-12-27 08:07:34,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:07:34" (1/1) ... [2019-12-27 08:07:34,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:07:34,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:07:35,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:35,143 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:07:35,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:07:35,306 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:07:35,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35 WrapperNode [2019-12-27 08:07:35,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:07:35,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:35,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:07:35,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:07:35,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:07:35,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:07:35,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:07:35,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:07:35,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (1/1) ... [2019-12-27 08:07:35,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:07:35,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:07:35,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:07:35,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:07:35,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07: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-27 08:07:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:07:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:07:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:07:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:07:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:07:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:07:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:07:35,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:07:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:07:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:07:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:07:35,481 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:07:36,262 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:07:36,263 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:07:36,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:36 BoogieIcfgContainer [2019-12-27 08:07:36,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:07:36,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:07:36,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:07:36,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:07:36,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:07:34" (1/3) ... [2019-12-27 08:07:36,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fc0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:36, skipping insertion in model container [2019-12-27 08:07:36,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:07:35" (2/3) ... [2019-12-27 08:07:36,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fc0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:07:36, skipping insertion in model container [2019-12-27 08:07:36,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:07:36" (3/3) ... [2019-12-27 08:07:36,277 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-27 08:07:36,287 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:07:36,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:07:36,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:07:36,296 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:07:36,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,338 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:07:36,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:07:36,402 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:07:36,402 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:07:36,402 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:07:36,402 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:07:36,402 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:07:36,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:07:36,403 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:07:36,403 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:07:36,417 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 08:07:36,419 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:36,532 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:36,532 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:36,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:36,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 08:07:36,632 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 08:07:36,633 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:07:36,638 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 08:07:36,650 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 08:07:36,652 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:07:39,687 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 08:07:39,790 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48987 [2019-12-27 08:07:39,790 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2019-12-27 08:07:39,794 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 08:07:40,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9272 states. [2019-12-27 08:07:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states. [2019-12-27 08:07:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:07:40,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:40,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:07:40,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 713212, now seen corresponding path program 1 times [2019-12-27 08:07:40,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947682428] [2019-12-27 08:07:40,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:40,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947682428] [2019-12-27 08:07:40,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:40,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:07:40,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987130164] [2019-12-27 08:07:40,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:40,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:40,731 INFO L87 Difference]: Start difference. First operand 9272 states. Second operand 3 states. [2019-12-27 08:07:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:41,056 INFO L93 Difference]: Finished difference Result 9157 states and 30129 transitions. [2019-12-27 08:07:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:41,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:07:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:41,154 INFO L225 Difference]: With dead ends: 9157 [2019-12-27 08:07:41,154 INFO L226 Difference]: Without dead ends: 8975 [2019-12-27 08:07:41,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-12-27 08:07:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8975. [2019-12-27 08:07:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2019-12-27 08:07:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 29569 transitions. [2019-12-27 08:07:41,640 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 29569 transitions. Word has length 3 [2019-12-27 08:07:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:41,641 INFO L462 AbstractCegarLoop]: Abstraction has 8975 states and 29569 transitions. [2019-12-27 08:07:41,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 29569 transitions. [2019-12-27 08:07:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:41,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:41,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:41,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:41,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1430597214, now seen corresponding path program 1 times [2019-12-27 08:07:41,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:41,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191232013] [2019-12-27 08:07:41,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:41,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191232013] [2019-12-27 08:07:41,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:41,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146198300] [2019-12-27 08:07:41,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:41,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:41,802 INFO L87 Difference]: Start difference. First operand 8975 states and 29569 transitions. Second operand 4 states. [2019-12-27 08:07:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:42,298 INFO L93 Difference]: Finished difference Result 13878 states and 43543 transitions. [2019-12-27 08:07:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:42,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:42,374 INFO L225 Difference]: With dead ends: 13878 [2019-12-27 08:07:42,374 INFO L226 Difference]: Without dead ends: 13871 [2019-12-27 08:07:42,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-27 08:07:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 12673. [2019-12-27 08:07:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 08:07:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 40347 transitions. [2019-12-27 08:07:43,690 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 40347 transitions. Word has length 11 [2019-12-27 08:07:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:43,691 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 40347 transitions. [2019-12-27 08:07:43,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 40347 transitions. [2019-12-27 08:07:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:07:43,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:43,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:43,703 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:43,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash 244087264, now seen corresponding path program 1 times [2019-12-27 08:07:43,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:43,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217462586] [2019-12-27 08:07:43,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:43,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217462586] [2019-12-27 08:07:43,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:43,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:43,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273690592] [2019-12-27 08:07:43,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:43,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:43,869 INFO L87 Difference]: Start difference. First operand 12673 states and 40347 transitions. Second operand 4 states. [2019-12-27 08:07:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:44,205 INFO L93 Difference]: Finished difference Result 15173 states and 47858 transitions. [2019-12-27 08:07:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:44,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:07:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:44,261 INFO L225 Difference]: With dead ends: 15173 [2019-12-27 08:07:44,261 INFO L226 Difference]: Without dead ends: 15173 [2019-12-27 08:07:44,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-27 08:07:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13657. [2019-12-27 08:07:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-27 08:07:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 43454 transitions. [2019-12-27 08:07:44,879 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 43454 transitions. Word has length 11 [2019-12-27 08:07:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:44,880 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 43454 transitions. [2019-12-27 08:07:44,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 43454 transitions. [2019-12-27 08:07:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:07:44,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:44,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:44,884 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1210915997, now seen corresponding path program 1 times [2019-12-27 08:07:44,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:44,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493985992] [2019-12-27 08:07:44,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:44,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493985992] [2019-12-27 08:07:44,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:44,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:44,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685637447] [2019-12-27 08:07:44,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:44,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:44,994 INFO L87 Difference]: Start difference. First operand 13657 states and 43454 transitions. Second operand 5 states. [2019-12-27 08:07:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:45,502 INFO L93 Difference]: Finished difference Result 18000 states and 55976 transitions. [2019-12-27 08:07:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:07:45,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:07:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:45,562 INFO L225 Difference]: With dead ends: 18000 [2019-12-27 08:07:45,562 INFO L226 Difference]: Without dead ends: 17993 [2019-12-27 08:07:45,562 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-27 08:07:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-27 08:07:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 13513. [2019-12-27 08:07:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-12-27 08:07:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 42886 transitions. [2019-12-27 08:07:46,149 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 42886 transitions. Word has length 17 [2019-12-27 08:07:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:46,150 INFO L462 AbstractCegarLoop]: Abstraction has 13513 states and 42886 transitions. [2019-12-27 08:07:46,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 42886 transitions. [2019-12-27 08:07:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:07:46,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:46,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:46,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash 368877695, now seen corresponding path program 1 times [2019-12-27 08:07:46,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:46,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579192397] [2019-12-27 08:07:46,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:46,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579192397] [2019-12-27 08:07:46,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:46,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:46,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159021786] [2019-12-27 08:07:46,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:46,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:46,259 INFO L87 Difference]: Start difference. First operand 13513 states and 42886 transitions. Second operand 3 states. [2019-12-27 08:07:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:46,380 INFO L93 Difference]: Finished difference Result 16497 states and 51650 transitions. [2019-12-27 08:07:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:46,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 08:07:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:46,468 INFO L225 Difference]: With dead ends: 16497 [2019-12-27 08:07:46,468 INFO L226 Difference]: Without dead ends: 16497 [2019-12-27 08:07:46,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-27 08:07:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14538. [2019-12-27 08:07:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-12-27 08:07:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 46033 transitions. [2019-12-27 08:07:47,651 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 46033 transitions. Word has length 25 [2019-12-27 08:07:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:47,655 INFO L462 AbstractCegarLoop]: Abstraction has 14538 states and 46033 transitions. [2019-12-27 08:07:47,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 46033 transitions. [2019-12-27 08:07:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:07:47,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:47,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:47,677 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash 276108521, now seen corresponding path program 1 times [2019-12-27 08:07:47,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:47,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128485742] [2019-12-27 08:07:47,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:47,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128485742] [2019-12-27 08:07:47,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:47,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:07:47,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613728171] [2019-12-27 08:07:47,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:47,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:47,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:47,781 INFO L87 Difference]: Start difference. First operand 14538 states and 46033 transitions. Second operand 6 states. [2019-12-27 08:07:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:48,249 INFO L93 Difference]: Finished difference Result 20241 states and 62761 transitions. [2019-12-27 08:07:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:07:48,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 08:07:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:48,287 INFO L225 Difference]: With dead ends: 20241 [2019-12-27 08:07:48,287 INFO L226 Difference]: Without dead ends: 20225 [2019-12-27 08:07:48,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:07:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2019-12-27 08:07:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 16589. [2019-12-27 08:07:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-27 08:07:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 52200 transitions. [2019-12-27 08:07:48,747 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 52200 transitions. Word has length 25 [2019-12-27 08:07:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:48,747 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 52200 transitions. [2019-12-27 08:07:48,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 52200 transitions. [2019-12-27 08:07:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:07:48,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:48,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:48,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:48,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1785185324, now seen corresponding path program 1 times [2019-12-27 08:07:48,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:48,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298687027] [2019-12-27 08:07:48,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:48,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298687027] [2019-12-27 08:07:48,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:48,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:07:48,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248493591] [2019-12-27 08:07:48,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:07:48,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:07:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:07:48,984 INFO L87 Difference]: Start difference. First operand 16589 states and 52200 transitions. Second operand 4 states. [2019-12-27 08:07:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:49,020 INFO L93 Difference]: Finished difference Result 2316 states and 5300 transitions. [2019-12-27 08:07:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:07:49,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 08:07:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:49,024 INFO L225 Difference]: With dead ends: 2316 [2019-12-27 08:07:49,026 INFO L226 Difference]: Without dead ends: 2039 [2019-12-27 08:07:49,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-12-27 08:07:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2019-12-27 08:07:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-27 08:07:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4534 transitions. [2019-12-27 08:07:49,061 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4534 transitions. Word has length 31 [2019-12-27 08:07:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,061 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4534 transitions. [2019-12-27 08:07:49,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:07:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4534 transitions. [2019-12-27 08:07:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:07:49,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,066 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-27 08:07:49,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1705539938, now seen corresponding path program 1 times [2019-12-27 08:07:49,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640871904] [2019-12-27 08:07:49,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:49,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640871904] [2019-12-27 08:07:49,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:49,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:49,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668004618] [2019-12-27 08:07:49,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:07:49,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:07:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:07:49,197 INFO L87 Difference]: Start difference. First operand 2039 states and 4534 transitions. Second operand 7 states. [2019-12-27 08:07:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:49,744 INFO L93 Difference]: Finished difference Result 2608 states and 5669 transitions. [2019-12-27 08:07:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:07:49,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 08:07:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:49,748 INFO L225 Difference]: With dead ends: 2608 [2019-12-27 08:07:49,749 INFO L226 Difference]: Without dead ends: 2606 [2019-12-27 08:07:49,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:07:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-27 08:07:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2100. [2019-12-27 08:07:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-27 08:07:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4675 transitions. [2019-12-27 08:07:49,788 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4675 transitions. Word has length 37 [2019-12-27 08:07:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4675 transitions. [2019-12-27 08:07:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:07:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4675 transitions. [2019-12-27 08:07:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:07:49,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:49,794 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] [2019-12-27 08:07:49,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1992807550, now seen corresponding path program 1 times [2019-12-27 08:07:49,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:49,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509685887] [2019-12-27 08:07:49,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:49,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509685887] [2019-12-27 08:07:49,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:49,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:49,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413973178] [2019-12-27 08:07:49,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:49,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:49,890 INFO L87 Difference]: Start difference. First operand 2100 states and 4675 transitions. Second operand 5 states. [2019-12-27 08:07:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:50,445 INFO L93 Difference]: Finished difference Result 2859 states and 6230 transitions. [2019-12-27 08:07:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:50,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 08:07:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:50,450 INFO L225 Difference]: With dead ends: 2859 [2019-12-27 08:07:50,450 INFO L226 Difference]: Without dead ends: 2859 [2019-12-27 08:07:50,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-12-27 08:07:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2524. [2019-12-27 08:07:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-12-27 08:07:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 5561 transitions. [2019-12-27 08:07:50,493 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 5561 transitions. Word has length 41 [2019-12-27 08:07:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:50,493 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 5561 transitions. [2019-12-27 08:07:50,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 5561 transitions. [2019-12-27 08:07:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:07:50,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:50,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:50,499 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 621749952, now seen corresponding path program 1 times [2019-12-27 08:07:50,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:50,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546043159] [2019-12-27 08:07:50,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:50,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546043159] [2019-12-27 08:07:50,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:50,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:50,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165120548] [2019-12-27 08:07:50,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:50,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:50,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:50,589 INFO L87 Difference]: Start difference. First operand 2524 states and 5561 transitions. Second operand 5 states. [2019-12-27 08:07:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,144 INFO L93 Difference]: Finished difference Result 3398 states and 7362 transitions. [2019-12-27 08:07:51,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:07:51,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 08:07:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,148 INFO L225 Difference]: With dead ends: 3398 [2019-12-27 08:07:51,149 INFO L226 Difference]: Without dead ends: 3398 [2019-12-27 08:07:51,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:07:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-27 08:07:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2821. [2019-12-27 08:07:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-27 08:07:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 6202 transitions. [2019-12-27 08:07:51,231 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 6202 transitions. Word has length 42 [2019-12-27 08:07:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,231 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 6202 transitions. [2019-12-27 08:07:51,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 6202 transitions. [2019-12-27 08:07:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:07:51,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1119205876, now seen corresponding path program 1 times [2019-12-27 08:07:51,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479091] [2019-12-27 08:07:51,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:51,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479091] [2019-12-27 08:07:51,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:51,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:07:51,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961912577] [2019-12-27 08:07:51,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:07:51,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:51,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:07:51,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:07:51,337 INFO L87 Difference]: Start difference. First operand 2821 states and 6202 transitions. Second operand 5 states. [2019-12-27 08:07:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,380 INFO L93 Difference]: Finished difference Result 709 states and 1307 transitions. [2019-12-27 08:07:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:07:51,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 08:07:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,382 INFO L225 Difference]: With dead ends: 709 [2019-12-27 08:07:51,382 INFO L226 Difference]: Without dead ends: 629 [2019-12-27 08:07:51,382 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-27 08:07:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-27 08:07:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 503. [2019-12-27 08:07:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-12-27 08:07:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 918 transitions. [2019-12-27 08:07:51,390 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 918 transitions. Word has length 42 [2019-12-27 08:07:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,392 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 918 transitions. [2019-12-27 08:07:51,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:07:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 918 transitions. [2019-12-27 08:07:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:51,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 703118835, now seen corresponding path program 1 times [2019-12-27 08:07:51,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47255626] [2019-12-27 08:07:51,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:51,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47255626] [2019-12-27 08:07:51,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:51,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:07:51,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101182586] [2019-12-27 08:07:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:51,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:51,519 INFO L87 Difference]: Start difference. First operand 503 states and 918 transitions. Second operand 6 states. [2019-12-27 08:07:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,830 INFO L93 Difference]: Finished difference Result 704 states and 1273 transitions. [2019-12-27 08:07:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:07:51,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 08:07:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,832 INFO L225 Difference]: With dead ends: 704 [2019-12-27 08:07:51,832 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 08:07:51,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:07:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 08:07:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 536. [2019-12-27 08:07:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 08:07:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 979 transitions. [2019-12-27 08:07:51,838 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 979 transitions. Word has length 52 [2019-12-27 08:07:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,839 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 979 transitions. [2019-12-27 08:07:51,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 979 transitions. [2019-12-27 08:07:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 08:07:51,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,840 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -916255553, now seen corresponding path program 2 times [2019-12-27 08:07:51,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475753793] [2019-12-27 08:07:51,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:51,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475753793] [2019-12-27 08:07:51,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:51,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:51,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856159317] [2019-12-27 08:07:51,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:51,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:51,888 INFO L87 Difference]: Start difference. First operand 536 states and 979 transitions. Second operand 3 states. [2019-12-27 08:07:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:51,900 INFO L93 Difference]: Finished difference Result 483 states and 859 transitions. [2019-12-27 08:07:51,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:51,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 08:07:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:51,901 INFO L225 Difference]: With dead ends: 483 [2019-12-27 08:07:51,901 INFO L226 Difference]: Without dead ends: 483 [2019-12-27 08:07:51,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-27 08:07:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-12-27 08:07:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-27 08:07:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 859 transitions. [2019-12-27 08:07:51,908 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 859 transitions. Word has length 52 [2019-12-27 08:07:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:51,908 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 859 transitions. [2019-12-27 08:07:51,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 859 transitions. [2019-12-27 08:07:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 08:07:51,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:51,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:51,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1906202407, now seen corresponding path program 1 times [2019-12-27 08:07:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:51,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088185721] [2019-12-27 08:07:51,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:52,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088185721] [2019-12-27 08:07:52,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:52,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:07:52,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675297182] [2019-12-27 08:07:52,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:07:52,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:07:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:07:52,014 INFO L87 Difference]: Start difference. First operand 483 states and 859 transitions. Second operand 6 states. [2019-12-27 08:07:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:52,077 INFO L93 Difference]: Finished difference Result 819 states and 1460 transitions. [2019-12-27 08:07:52,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:07:52,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 08:07:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:52,079 INFO L225 Difference]: With dead ends: 819 [2019-12-27 08:07:52,079 INFO L226 Difference]: Without dead ends: 405 [2019-12-27 08:07:52,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:07:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-12-27 08:07:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 357. [2019-12-27 08:07:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-27 08:07:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 641 transitions. [2019-12-27 08:07:52,084 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 641 transitions. Word has length 53 [2019-12-27 08:07:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:52,085 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 641 transitions. [2019-12-27 08:07:52,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:07:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 641 transitions. [2019-12-27 08:07:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 08:07:52,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:07:52,086 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash -504557933, now seen corresponding path program 2 times [2019-12-27 08:07:52,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:52,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591151381] [2019-12-27 08:07:52,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:52,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591151381] [2019-12-27 08:07:52,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:52,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:07:52,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151461807] [2019-12-27 08:07:52,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:07:52,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:07:52,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:52,144 INFO L87 Difference]: Start difference. First operand 357 states and 641 transitions. Second operand 3 states. [2019-12-27 08:07:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:52,183 INFO L93 Difference]: Finished difference Result 356 states and 639 transitions. [2019-12-27 08:07:52,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:07:52,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 08:07:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:52,184 INFO L225 Difference]: With dead ends: 356 [2019-12-27 08:07:52,185 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 08:07:52,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:07:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 08:07:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 220. [2019-12-27 08:07:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 08:07:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 391 transitions. [2019-12-27 08:07:52,189 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 391 transitions. Word has length 53 [2019-12-27 08:07:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:52,189 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 391 transitions. [2019-12-27 08:07:52,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:07:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 391 transitions. [2019-12-27 08:07:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:52,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:52,190 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-27 08:07:52,191 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 10303747, now seen corresponding path program 1 times [2019-12-27 08:07:52,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:52,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315457335] [2019-12-27 08:07:52,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315457335] [2019-12-27 08:07:52,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:52,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:07:52,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826341899] [2019-12-27 08:07:52,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:07:52,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:07:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:07:52,451 INFO L87 Difference]: Start difference. First operand 220 states and 391 transitions. Second operand 13 states. [2019-12-27 08:07:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:53,036 INFO L93 Difference]: Finished difference Result 386 states and 665 transitions. [2019-12-27 08:07:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:07:53,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 08:07:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:53,037 INFO L225 Difference]: With dead ends: 386 [2019-12-27 08:07:53,037 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 08:07:53,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:07:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 08:07:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-27 08:07:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 08:07:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 562 transitions. [2019-12-27 08:07:53,041 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 562 transitions. Word has length 54 [2019-12-27 08:07:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:53,041 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 562 transitions. [2019-12-27 08:07:53,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:07:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 562 transitions. [2019-12-27 08:07:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:53,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:53,042 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-27 08:07:53,042 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash 691777001, now seen corresponding path program 2 times [2019-12-27 08:07:53,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:53,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136169375] [2019-12-27 08:07:53,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:07:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:07:53,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136169375] [2019-12-27 08:07:53,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:07:53,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:07:53,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196111318] [2019-12-27 08:07:53,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:07:53,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:07:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:07:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:07:53,275 INFO L87 Difference]: Start difference. First operand 320 states and 562 transitions. Second operand 13 states. [2019-12-27 08:07:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:07:53,829 INFO L93 Difference]: Finished difference Result 422 states and 716 transitions. [2019-12-27 08:07:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:07:53,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 08:07:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:07:53,831 INFO L225 Difference]: With dead ends: 422 [2019-12-27 08:07:53,831 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 08:07:53,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:07:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 08:07:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-27 08:07:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 08:07:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 576 transitions. [2019-12-27 08:07:53,837 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 576 transitions. Word has length 54 [2019-12-27 08:07:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:07:53,838 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 576 transitions. [2019-12-27 08:07:53,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:07:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 576 transitions. [2019-12-27 08:07:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:07:53,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:07:53,839 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-27 08:07:53,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:07:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:07:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1943788027, now seen corresponding path program 3 times [2019-12-27 08:07:53,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:07:53,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259491792] [2019-12-27 08:07:53,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:07:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:07:53,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:07:53,942 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:07:53,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| 4)) (= 0 |v_ULTIMATE.start_main_~#t2481~0.offset_16|) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~y$r_buff1_thd0~0_45) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_108 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= (select .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19|) 0) (= v_~y~0_28 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2481~0.base_19|) (= v_~y$w_buff1_used~0_62 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19| 1)) (= v_~y$r_buff0_thd0~0_81 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$r_buff1_thd1~0_17) (= 0 v_~weak$$choice2~0_31) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19|) |v_ULTIMATE.start_main_~#t2481~0.offset_16| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2481~0.offset=|v_ULTIMATE.start_main_~#t2481~0.offset_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_19|, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_28, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t2481~0.base=|v_ULTIMATE.start_main_~#t2481~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_62} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t2481~0.offset, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2482~0.base, #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, ULTIMATE.start_main_~#t2482~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, 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, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, 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, ULTIMATE.start_main_~#t2481~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:07:53,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L777-1-->L779: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2482~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11|) |v_ULTIMATE.start_main_~#t2482~0.offset_10| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2482~0.base_11|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2482~0.offset_10|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| 4) |v_#length_9|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_10|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2482~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2482~0.base, #length] because there is no mapped edge [2019-12-27 08:07:54,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 2 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_52 v_~y$w_buff0_used~0_89) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_18) (= 0 (mod v_~y$w_buff1_used~0_52 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 1 v_~y$w_buff0_used~0_88)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_21, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_52} 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-27 08:07:54,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-898000960 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-898000960 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-898000960| ~y$w_buff0_used~0_In-898000960) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-898000960|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-898000960, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-898000960} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-898000960|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-898000960, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-898000960} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 08:07:54,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-364396756 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-364396756 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-364396756 |P1Thread1of1ForFork1_#t~ite9_Out-364396756|)) (and (= ~y~0_In-364396756 |P1Thread1of1ForFork1_#t~ite9_Out-364396756|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-364396756, ~y$w_buff1~0=~y$w_buff1~0_In-364396756, ~y~0=~y~0_In-364396756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-364396756} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-364396756, ~y$w_buff1~0=~y$w_buff1~0_In-364396756, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-364396756|, ~y~0=~y~0_In-364396756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-364396756} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 08:07:54,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) 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_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 08:07:54,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1381135102 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1381135102 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1381135102| ~y$w_buff0_used~0_In-1381135102) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1381135102| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381135102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1381135102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381135102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1381135102, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1381135102|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 08:07:54,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1605782170 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1605782170 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1605782170 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1605782170 256) 0))) (or (and (= ~y$w_buff1_used~0_In1605782170 |P0Thread1of1ForFork0_#t~ite6_Out1605782170|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1605782170| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1605782170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605782170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1605782170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605782170} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1605782170|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1605782170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605782170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1605782170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605782170} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 08:07:54,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2043194122 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2043194122 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out2043194122) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In2043194122 ~y$r_buff0_thd1~0_Out2043194122) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2043194122, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2043194122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2043194122, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2043194122|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2043194122} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 08:07:54,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In2132022758 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2132022758 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2132022758 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2132022758 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out2132022758| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out2132022758| ~y$w_buff1_used~0_In2132022758) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2132022758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2132022758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2132022758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132022758} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2132022758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2132022758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2132022758, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2132022758|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132022758} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 08:07:54,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In267100990 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In267100990 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out267100990| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out267100990| ~y$r_buff0_thd2~0_In267100990) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In267100990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In267100990} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In267100990, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In267100990, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out267100990|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 08:07:54,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1073828068 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1073828068 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1073828068 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1073828068 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1073828068| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1073828068| ~y$r_buff1_thd2~0_In1073828068)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1073828068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1073828068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1073828068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1073828068} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1073828068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1073828068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1073828068, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1073828068|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1073828068} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:07:54,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, 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_11, 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-27 08:07:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1953158177 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1953158177 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1953158177 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1953158177 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1953158177|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-1953158177 |P0Thread1of1ForFork0_#t~ite8_Out-1953158177|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953158177, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953158177, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953158177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953158177} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953158177, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953158177, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1953158177|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953158177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953158177} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 08:07:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L738-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, 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_8} 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-27 08:07:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= (mod v_~y$w_buff0_used~0_75 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 08:07:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1230142072 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1230142072 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1230142072| ~y$w_buff1~0_In1230142072) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out1230142072| ~y~0_In1230142072) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1230142072, ~y~0=~y~0_In1230142072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1230142072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1230142072} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1230142072|, ~y$w_buff1~0=~y$w_buff1~0_In1230142072, ~y~0=~y~0_In1230142072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1230142072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1230142072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 08:07:54,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 08:07:54,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1147348555 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1147348555 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1147348555 |ULTIMATE.start_main_#t~ite19_Out-1147348555|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1147348555|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1147348555, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1147348555} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1147348555, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1147348555|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1147348555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 08:07:54,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In2135363351 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2135363351 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2135363351 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2135363351 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out2135363351| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out2135363351| ~y$w_buff1_used~0_In2135363351) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135363351, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2135363351, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2135363351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135363351} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2135363351, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2135363351, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2135363351|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2135363351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135363351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 08:07:54,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1099086576 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1099086576 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1099086576| ~y$r_buff0_thd0~0_In-1099086576) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1099086576| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099086576, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1099086576} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099086576, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1099086576, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1099086576|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 08:07:54,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-127805354 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-127805354 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-127805354 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-127805354 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-127805354| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out-127805354| ~y$r_buff1_thd0~0_In-127805354) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-127805354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-127805354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-127805354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-127805354} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-127805354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-127805354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-127805354, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-127805354|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-127805354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 08:07:54,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L799-->L799-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In855342862 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In855342862 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In855342862 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In855342862 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In855342862 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite34_Out855342862| ~y$w_buff0_used~0_In855342862) (= |ULTIMATE.start_main_#t~ite35_Out855342862| |ULTIMATE.start_main_#t~ite34_Out855342862|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out855342862| ~y$w_buff0_used~0_In855342862) (= |ULTIMATE.start_main_#t~ite34_In855342862| |ULTIMATE.start_main_#t~ite34_Out855342862|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In855342862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855342862, ~weak$$choice2~0=~weak$$choice2~0_In855342862, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855342862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855342862, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In855342862|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In855342862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In855342862, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out855342862|, ~weak$$choice2~0=~weak$$choice2~0_In855342862, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In855342862, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out855342862|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855342862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 08:07:54,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_19} 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-27 08:07:54,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_24 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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-27 08:07:54,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 08:07:54,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:07:54 BasicIcfg [2019-12-27 08:07:54,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:07:54,082 INFO L168 Benchmark]: Toolchain (without parser) took 19555.36 ms. Allocated memory was 145.8 MB in the beginning and 857.2 MB in the end (delta: 711.5 MB). Free memory was 100.8 MB in the beginning and 694.9 MB in the end (delta: -594.1 MB). Peak memory consumption was 578.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,083 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.02 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 157.7 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 154.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,085 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,086 INFO L168 Benchmark]: RCFGBuilder took 854.47 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.5 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,086 INFO L168 Benchmark]: TraceAbstraction took 17813.72 ms. Allocated memory was 203.4 MB in the beginning and 857.2 MB in the end (delta: 653.8 MB). Free memory was 108.5 MB in the beginning and 694.9 MB in the end (delta: -586.4 MB). Peak memory consumption was 528.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:07:54,090 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.49 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.02 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 157.7 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 154.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.47 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.5 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17813.72 ms. Allocated memory was 203.4 MB in the beginning and 857.2 MB in the end (delta: 653.8 MB). Free memory was 108.5 MB in the beginning and 694.9 MB in the end (delta: -586.4 MB). Peak memory consumption was 528.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 80 ProgramPointsAfterwards, 179 TransitionsBefore, 93 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 24 ChoiceCompositions, 3351 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48987 CheckedPairsTotal, 94 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=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] [L734] 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, 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] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L734] 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) [L754] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 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) [L797] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 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)) [L798] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 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)) [L799] 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)) [L800] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 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)) [L802] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 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)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, 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=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2270 SDtfs, 2018 SDslu, 4895 SDs, 0 SdLazy, 3274 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16589occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 14781 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 91276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...