/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/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:54:07,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:54:07,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:54:07,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:54:07,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:54:07,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:54:07,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:54:07,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:54:07,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:54:07,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:54:07,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:54:07,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:54:07,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:54:07,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:54:07,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:54:07,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:54:07,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:54:07,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:54:07,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:54:07,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:54:07,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:54:07,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:54:07,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:54:07,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:54:07,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:54:07,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:54:07,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:54:07,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:54:07,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:54:07,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:54:07,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:54:07,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:54:07,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:54:07,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:54:07,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:54:07,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:54:07,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:54:07,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:54:07,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:54:07,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:54:07,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:54:07,362 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 06:54:07,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:54:07,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:54:07,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:54:07,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:54:07,398 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:54:07,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:54:07,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:54:07,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:54:07,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:54:07,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:54:07,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:54:07,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:54:07,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:54:07,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:54:07,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:54:07,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:54:07,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:54:07,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:54:07,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:54:07,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:54:07,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:54:07,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:54:07,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:54:07,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:54:07,730 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:54:07,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-27 06:54:07,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcf76f61/e0a29cc6e9674024913edb020bb60a45/FLAGeb204fa50 [2019-12-27 06:54:08,327 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:54:08,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-27 06:54:08,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcf76f61/e0a29cc6e9674024913edb020bb60a45/FLAGeb204fa50 [2019-12-27 06:54:08,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcf76f61/e0a29cc6e9674024913edb020bb60a45 [2019-12-27 06:54:08,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:54:08,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:54:08,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:08,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:54:08,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:54:08,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:08" (1/1) ... [2019-12-27 06:54:08,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:08, skipping insertion in model container [2019-12-27 06:54:08,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:08" (1/1) ... [2019-12-27 06:54:08,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:54:08,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:54:09,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:09,271 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:54:09,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:09,465 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:54:09,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09 WrapperNode [2019-12-27 06:54:09,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:09,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:09,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:54:09,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:54:09,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:09,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:54:09,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:54:09,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:54:09,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (1/1) ... [2019-12-27 06:54:09,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:54:09,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:54:09,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:54:09,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:54:09,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (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 06:54:09,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:54:09,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:54:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:54:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:54:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:54:09,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:54:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:54:09,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:54:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:54:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:54:09,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:54:09,643 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 06:54:10,327 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:54:10,327 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:54:10,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:10 BoogieIcfgContainer [2019-12-27 06:54:10,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:54:10,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:54:10,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:54:10,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:54:10,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:08" (1/3) ... [2019-12-27 06:54:10,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac89f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:10, skipping insertion in model container [2019-12-27 06:54:10,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:09" (2/3) ... [2019-12-27 06:54:10,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac89f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:10, skipping insertion in model container [2019-12-27 06:54:10,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:10" (3/3) ... [2019-12-27 06:54:10,342 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-27 06:54:10,354 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:54:10,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:54:10,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:54:10,367 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:54:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,453 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,454 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:10,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:54:10,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:54:10,499 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:54:10,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:54:10,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:54:10,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:54:10,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:54:10,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:54:10,500 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:54:10,517 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 06:54:10,519 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:10,621 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:10,621 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:10,634 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:10,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:10,734 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:10,734 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:10,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:10,762 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:54:10,763 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:54:13,602 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 06:54:13,722 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 06:54:13,722 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 06:54:13,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 06:54:14,227 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:54:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:54:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:54:14,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:14,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:54:14,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:14,244 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 06:54:14,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:14,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162475343] [2019-12-27 06:54:14,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:14,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162475343] [2019-12-27 06:54:14,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:14,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:14,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753289720] [2019-12-27 06:54:14,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:14,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:14,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:14,513 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:54:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:14,852 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 06:54:14,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:14,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:54:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:14,952 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 06:54:14,952 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 06:54:14,954 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 06:54:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 06:54:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 06:54:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 06:54:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 06:54:15,481 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 06:54:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:15,481 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 06:54:15,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 06:54:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:54:15,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:15,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:15,487 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 06:54:15,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:15,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168514472] [2019-12-27 06:54:15,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:15,632 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 06:54:15,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168514472] [2019-12-27 06:54:15,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:15,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:15,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770584898] [2019-12-27 06:54:15,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:15,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:15,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:15,638 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 06:54:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:15,679 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 06:54:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:15,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:54:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:15,690 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 06:54:15,690 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 06:54:15,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 06:54:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 06:54:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 06:54:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 06:54:15,725 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 06:54:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:15,726 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 06:54:15,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 06:54:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:54:15,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:15,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:15,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 06:54:15,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:15,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553803934] [2019-12-27 06:54:15,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:15,838 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 06:54:15,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553803934] [2019-12-27 06:54:15,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:15,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:15,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741881613] [2019-12-27 06:54:15,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:15,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:15,840 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 4 states. [2019-12-27 06:54:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:16,166 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 06:54:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:16,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:54:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:16,178 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 06:54:16,178 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 06:54:16,179 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 06:54:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 06:54:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 06:54:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 06:54:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 06:54:16,233 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 06:54:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:16,234 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 06:54:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 06:54:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:54:16,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:16,242 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] [2019-12-27 06:54:16,242 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 06:54:16,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:16,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275979710] [2019-12-27 06:54:16,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:16,369 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 06:54:16,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275979710] [2019-12-27 06:54:16,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:16,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:16,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86463084] [2019-12-27 06:54:16,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:16,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:16,375 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 4 states. [2019-12-27 06:54:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:16,404 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 06:54:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:16,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 06:54:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:16,408 INFO L225 Difference]: With dead ends: 357 [2019-12-27 06:54:16,408 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 06:54:16,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 06:54:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 06:54:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:54:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 06:54:16,418 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 06:54:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:16,418 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 06:54:16,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 06:54:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:16,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:16,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:16,421 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 06:54:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:16,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672493134] [2019-12-27 06:54:16,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:16,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672493134] [2019-12-27 06:54:16,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:16,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:16,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864392922] [2019-12-27 06:54:16,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:16,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:16,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:16,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:16,550 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 06:54:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:16,617 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 06:54:16,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:16,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:16,621 INFO L225 Difference]: With dead ends: 332 [2019-12-27 06:54:16,621 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 06:54:16,621 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 06:54:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 06:54:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 06:54:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 06:54:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 06:54:16,631 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 06:54:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:16,635 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 06:54:16,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 06:54:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:16,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:16,641 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 06:54:16,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 06:54:16,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:16,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245301376] [2019-12-27 06:54:16,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:16,765 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 06:54:16,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245301376] [2019-12-27 06:54:16,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:16,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:16,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249166252] [2019-12-27 06:54:16,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:16,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:16,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:16,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:16,767 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 06:54:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:17,021 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 06:54:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:17,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 06:54:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:17,025 INFO L225 Difference]: With dead ends: 459 [2019-12-27 06:54:17,025 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 06:54:17,025 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 06:54:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 06:54:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 06:54:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 06:54:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 06:54:17,096 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 06:54:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:17,098 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 06:54:17,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 06:54:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:17,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:17,099 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 06:54:17,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 06:54:17,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290712907] [2019-12-27 06:54:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:17,260 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 06:54:17,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290712907] [2019-12-27 06:54:17,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:17,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:17,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700149335] [2019-12-27 06:54:17,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:17,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:17,262 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 6 states. [2019-12-27 06:54:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:17,603 INFO L93 Difference]: Finished difference Result 514 states and 945 transitions. [2019-12-27 06:54:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:54:17,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 06:54:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:17,607 INFO L225 Difference]: With dead ends: 514 [2019-12-27 06:54:17,607 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 06:54:17,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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 06:54:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 06:54:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 407. [2019-12-27 06:54:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 06:54:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 757 transitions. [2019-12-27 06:54:17,617 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 757 transitions. Word has length 52 [2019-12-27 06:54:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:17,618 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 757 transitions. [2019-12-27 06:54:17,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 757 transitions. [2019-12-27 06:54:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:17,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:17,619 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 06:54:17,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash -105866605, now seen corresponding path program 3 times [2019-12-27 06:54:17,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:17,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658624914] [2019-12-27 06:54:17,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:17,728 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 06:54:17,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658624914] [2019-12-27 06:54:17,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:17,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525575372] [2019-12-27 06:54:17,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:17,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:17,730 INFO L87 Difference]: Start difference. First operand 407 states and 757 transitions. Second operand 6 states. [2019-12-27 06:54:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,059 INFO L93 Difference]: Finished difference Result 697 states and 1280 transitions. [2019-12-27 06:54:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:54:18,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 06:54:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,064 INFO L225 Difference]: With dead ends: 697 [2019-12-27 06:54:18,064 INFO L226 Difference]: Without dead ends: 697 [2019-12-27 06:54:18,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:54:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-12-27 06:54:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 446. [2019-12-27 06:54:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-27 06:54:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 836 transitions. [2019-12-27 06:54:18,076 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 836 transitions. Word has length 52 [2019-12-27 06:54:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,076 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 836 transitions. [2019-12-27 06:54:18,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 836 transitions. [2019-12-27 06:54:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:18,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,078 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 06:54:18,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 499685509, now seen corresponding path program 4 times [2019-12-27 06:54:18,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179060173] [2019-12-27 06:54:18,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,128 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 06:54:18,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179060173] [2019-12-27 06:54:18,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:18,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969638727] [2019-12-27 06:54:18,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:18,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:18,130 INFO L87 Difference]: Start difference. First operand 446 states and 836 transitions. Second operand 3 states. [2019-12-27 06:54:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,142 INFO L93 Difference]: Finished difference Result 407 states and 742 transitions. [2019-12-27 06:54:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:18,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,144 INFO L225 Difference]: With dead ends: 407 [2019-12-27 06:54:18,145 INFO L226 Difference]: Without dead ends: 407 [2019-12-27 06:54:18,145 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 06:54:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-27 06:54:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-12-27 06:54:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 06:54:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 742 transitions. [2019-12-27 06:54:18,153 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 742 transitions. Word has length 52 [2019-12-27 06:54:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,154 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 742 transitions. [2019-12-27 06:54:18,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 742 transitions. [2019-12-27 06:54:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:18,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,155 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 06:54:18,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1369378336, now seen corresponding path program 1 times [2019-12-27 06:54:18,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324637061] [2019-12-27 06:54:18,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:18,389 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 06:54:18,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324637061] [2019-12-27 06:54:18,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:18,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:54:18,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773163549] [2019-12-27 06:54:18,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:54:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:54:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:54:18,391 INFO L87 Difference]: Start difference. First operand 407 states and 742 transitions. Second operand 8 states. [2019-12-27 06:54:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:18,915 INFO L93 Difference]: Finished difference Result 651 states and 1156 transitions. [2019-12-27 06:54:18,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:54:18,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 06:54:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:18,919 INFO L225 Difference]: With dead ends: 651 [2019-12-27 06:54:18,919 INFO L226 Difference]: Without dead ends: 651 [2019-12-27 06:54:18,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:54:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-12-27 06:54:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 363. [2019-12-27 06:54:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 06:54:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 657 transitions. [2019-12-27 06:54:18,929 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 657 transitions. Word has length 53 [2019-12-27 06:54:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:18,930 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 657 transitions. [2019-12-27 06:54:18,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:54:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 657 transitions. [2019-12-27 06:54:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:18,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:18,931 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 06:54:18,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash 693182888, now seen corresponding path program 2 times [2019-12-27 06:54:18,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:18,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85559595] [2019-12-27 06:54:18,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:19,020 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 06:54:19,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85559595] [2019-12-27 06:54:19,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:19,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:19,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162994821] [2019-12-27 06:54:19,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:19,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:19,023 INFO L87 Difference]: Start difference. First operand 363 states and 657 transitions. Second operand 3 states. [2019-12-27 06:54:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:19,065 INFO L93 Difference]: Finished difference Result 363 states and 656 transitions. [2019-12-27 06:54:19,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:19,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:54:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:19,068 INFO L225 Difference]: With dead ends: 363 [2019-12-27 06:54:19,068 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 06:54:19,069 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 06:54:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 06:54:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 276. [2019-12-27 06:54:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-27 06:54:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 494 transitions. [2019-12-27 06:54:19,076 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 494 transitions. Word has length 53 [2019-12-27 06:54:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:19,077 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 494 transitions. [2019-12-27 06:54:19,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 494 transitions. [2019-12-27 06:54:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:19,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:19,078 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 06:54:19,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-27 06:54:19,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:19,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552010784] [2019-12-27 06:54:19,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:19,215 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 06:54:19,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552010784] [2019-12-27 06:54:19,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:19,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:19,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518262662] [2019-12-27 06:54:19,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:19,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:19,218 INFO L87 Difference]: Start difference. First operand 276 states and 494 transitions. Second operand 7 states. [2019-12-27 06:54:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:19,321 INFO L93 Difference]: Finished difference Result 481 states and 855 transitions. [2019-12-27 06:54:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:54:19,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:54:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:19,323 INFO L225 Difference]: With dead ends: 481 [2019-12-27 06:54:19,324 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 06:54:19,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 06:54:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 06:54:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 06:54:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 342 transitions. [2019-12-27 06:54:19,329 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 342 transitions. Word has length 54 [2019-12-27 06:54:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:19,330 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 342 transitions. [2019-12-27 06:54:19,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 342 transitions. [2019-12-27 06:54:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:19,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:19,331 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 06:54:19,331 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-27 06:54:19,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:19,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686531324] [2019-12-27 06:54:19,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:19,557 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 06:54:19,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686531324] [2019-12-27 06:54:19,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:19,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:54:19,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804162453] [2019-12-27 06:54:19,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:54:19,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:54:19,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:54:19,560 INFO L87 Difference]: Start difference. First operand 198 states and 342 transitions. Second operand 14 states. [2019-12-27 06:54:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:20,176 INFO L93 Difference]: Finished difference Result 366 states and 623 transitions. [2019-12-27 06:54:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:54:20,177 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 06:54:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:20,180 INFO L225 Difference]: With dead ends: 366 [2019-12-27 06:54:20,180 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 06:54:20,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:54:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 06:54:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2019-12-27 06:54:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-27 06:54:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 513 transitions. [2019-12-27 06:54:20,189 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 513 transitions. Word has length 54 [2019-12-27 06:54:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:20,189 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 513 transitions. [2019-12-27 06:54:20,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:54:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 513 transitions. [2019-12-27 06:54:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:20,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:20,191 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 06:54:20,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-27 06:54:20,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:20,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037636465] [2019-12-27 06:54:20,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:20,722 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 06:54:20,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037636465] [2019-12-27 06:54:20,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:20,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:54:20,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847956996] [2019-12-27 06:54:20,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:54:20,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:20,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:54:20,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:54:20,725 INFO L87 Difference]: Start difference. First operand 298 states and 513 transitions. Second operand 17 states. [2019-12-27 06:54:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:21,787 INFO L93 Difference]: Finished difference Result 557 states and 942 transitions. [2019-12-27 06:54:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 06:54:21,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 06:54:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:21,791 INFO L225 Difference]: With dead ends: 557 [2019-12-27 06:54:21,792 INFO L226 Difference]: Without dead ends: 523 [2019-12-27 06:54:21,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-12-27 06:54:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-27 06:54:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 308. [2019-12-27 06:54:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-27 06:54:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 531 transitions. [2019-12-27 06:54:21,800 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 531 transitions. Word has length 54 [2019-12-27 06:54:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:21,801 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 531 transitions. [2019-12-27 06:54:21,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:54:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 531 transitions. [2019-12-27 06:54:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:21,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:21,802 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 06:54:21,803 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2083989660, now seen corresponding path program 4 times [2019-12-27 06:54:21,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:21,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544556008] [2019-12-27 06:54:21,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:21,980 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 06:54:21,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544556008] [2019-12-27 06:54:21,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:21,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:54:21,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643671805] [2019-12-27 06:54:21,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:54:21,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:54:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:54:21,983 INFO L87 Difference]: Start difference. First operand 308 states and 531 transitions. Second operand 12 states. [2019-12-27 06:54:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:22,246 INFO L93 Difference]: Finished difference Result 412 states and 692 transitions. [2019-12-27 06:54:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:54:22,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 06:54:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:22,248 INFO L225 Difference]: With dead ends: 412 [2019-12-27 06:54:22,248 INFO L226 Difference]: Without dead ends: 378 [2019-12-27 06:54:22,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:54:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-27 06:54:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 306. [2019-12-27 06:54:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-27 06:54:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 527 transitions. [2019-12-27 06:54:22,256 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 527 transitions. Word has length 54 [2019-12-27 06:54:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 527 transitions. [2019-12-27 06:54:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:54:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 527 transitions. [2019-12-27 06:54:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:22,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:22,258 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 06:54:22,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 5 times [2019-12-27 06:54:22,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:22,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793021755] [2019-12-27 06:54:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:22,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:22,348 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:22,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$flush_delayed~0_16 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= v_~x$r_buff1_thd0~0_48 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$r_buff0_thd0~0_76) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~weak$$choice0~0_6) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:54:22,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:54:22,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:54:22,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1810032517| |P0Thread1of1ForFork0_#t~ite3_Out-1810032517|)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1810032517 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1810032517 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-1810032517 |P0Thread1of1ForFork0_#t~ite3_Out-1810032517|)) (and .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-1810032517| ~x~0_In-1810032517) (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1810032517, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1810032517, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1810032517, ~x~0=~x~0_In-1810032517} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1810032517|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1810032517|, ~x$w_buff1~0=~x$w_buff1~0_In-1810032517, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1810032517, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1810032517, ~x~0=~x~0_In-1810032517} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:54:22,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1902702990 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1902702990 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1902702990| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1902702990 |P0Thread1of1ForFork0_#t~ite5_Out1902702990|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1902702990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1902702990} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1902702990|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1902702990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1902702990} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:54:22,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1676644358 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1676644358 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1676644358 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1676644358 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1676644358 |P0Thread1of1ForFork0_#t~ite6_Out1676644358|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1676644358| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676644358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676644358, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676644358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676644358} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1676644358|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1676644358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1676644358, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1676644358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676644358} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:54:22,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In913302772 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In913302772 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out913302772|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In913302772 |P1Thread1of1ForFork1_#t~ite11_Out913302772|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In913302772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In913302772} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out913302772|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In913302772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In913302772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:54:22,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1398263539 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1398263539 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1398263539| ~x$r_buff0_thd1~0_In1398263539) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1398263539| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1398263539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1398263539} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1398263539, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1398263539|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1398263539} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:54:22,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In537999233 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In537999233 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In537999233 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In537999233 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out537999233| ~x$r_buff1_thd1~0_In537999233) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out537999233| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In537999233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In537999233, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In537999233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537999233} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In537999233, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out537999233|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In537999233, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In537999233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In537999233} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:54:22,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:54:22,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1453255604 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1453255604 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1453255604 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1453255604 256)))) (or (and (= ~x$w_buff1_used~0_In1453255604 |P1Thread1of1ForFork1_#t~ite12_Out1453255604|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1453255604|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1453255604, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1453255604, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1453255604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453255604} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1453255604, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1453255604, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1453255604|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1453255604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453255604} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:54:22,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1548507348 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1548507348 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1548507348) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1548507348 ~x$r_buff0_thd2~0_Out-1548507348)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1548507348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548507348} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1548507348|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1548507348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548507348} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:54:22,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-339688899 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-339688899 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-339688899 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-339688899 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-339688899| ~x$r_buff1_thd2~0_In-339688899) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-339688899|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-339688899, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-339688899, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-339688899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339688899} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-339688899, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-339688899, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-339688899, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-339688899|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339688899} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:54:22,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |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{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__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[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:54:22,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:54:22,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In2127307863 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out2127307863| |ULTIMATE.start_main_#t~ite17_Out2127307863|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2127307863 256)))) (or (and (= ~x~0_In2127307863 |ULTIMATE.start_main_#t~ite17_Out2127307863|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite17_Out2127307863| ~x$w_buff1~0_In2127307863) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2127307863, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127307863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127307863, ~x~0=~x~0_In2127307863} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out2127307863|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2127307863|, ~x$w_buff1~0=~x$w_buff1~0_In2127307863, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127307863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127307863, ~x~0=~x~0_In2127307863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 06:54:22,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In409408599 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In409408599 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out409408599|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In409408599 |ULTIMATE.start_main_#t~ite19_Out409408599|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In409408599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In409408599} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In409408599, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out409408599|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In409408599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:54:22,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1639116237 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1639116237 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1639116237 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1639116237 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1639116237|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1639116237 |ULTIMATE.start_main_#t~ite20_Out1639116237|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1639116237, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1639116237, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1639116237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1639116237} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1639116237, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1639116237, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1639116237|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1639116237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1639116237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:54:22,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1206219475 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1206219475 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1206219475| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1206219475| ~x$r_buff0_thd0~0_In1206219475) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1206219475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1206219475} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1206219475, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1206219475|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1206219475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:54:22,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2073237586 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2073237586 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2073237586 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2073237586 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-2073237586 |ULTIMATE.start_main_#t~ite22_Out-2073237586|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2073237586|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2073237586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2073237586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2073237586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2073237586} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2073237586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2073237586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2073237586, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2073237586|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2073237586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:54:22,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2074746145 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-2074746145| ~x$w_buff1~0_In-2074746145) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-2074746145| |ULTIMATE.start_main_#t~ite31_Out-2074746145|)) (and (= |ULTIMATE.start_main_#t~ite32_Out-2074746145| |ULTIMATE.start_main_#t~ite31_Out-2074746145|) (= |ULTIMATE.start_main_#t~ite31_Out-2074746145| ~x$w_buff1~0_In-2074746145) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2074746145 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-2074746145 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2074746145 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-2074746145 256) 0))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2074746145, ~x$w_buff1~0=~x$w_buff1~0_In-2074746145, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2074746145, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2074746145, ~weak$$choice2~0=~weak$$choice2~0_In-2074746145, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2074746145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074746145} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2074746145, ~x$w_buff1~0=~x$w_buff1~0_In-2074746145, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2074746145, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2074746145|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2074746145, ~weak$$choice2~0=~weak$$choice2~0_In-2074746145, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2074746145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074746145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:54:22,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:54:22,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:22,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:54:22,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:22 BasicIcfg [2019-12-27 06:54:22,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:22,439 INFO L168 Benchmark]: Toolchain (without parser) took 13807.55 ms. Allocated memory was 146.3 MB in the beginning and 437.3 MB in the end (delta: 291.0 MB). Free memory was 101.9 MB in the beginning and 206.4 MB in the end (delta: -104.6 MB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,440 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.50 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 157.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.84 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,442 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,445 INFO L168 Benchmark]: RCFGBuilder took 756.05 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,451 INFO L168 Benchmark]: TraceAbstraction took 12103.47 ms. Allocated memory was 203.4 MB in the beginning and 437.3 MB in the end (delta: 233.8 MB). Free memory was 108.2 MB in the beginning and 206.4 MB in the end (delta: -98.2 MB). Peak memory consumption was 135.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:22,458 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.50 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 157.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.84 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 756.05 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12103.47 ms. Allocated memory was 203.4 MB in the beginning and 437.3 MB in the end (delta: 233.8 MB). Free memory was 108.2 MB in the beginning and 206.4 MB in the end (delta: -98.2 MB). Peak memory consumption was 135.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1491 SDtfs, 1525 SDslu, 3855 SDs, 0 SdLazy, 2616 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 1353 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 686 NumberOfCodeBlocks, 686 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 119286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...