/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:06:35,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:06:35,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:06:35,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:06:35,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:06:35,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:06:35,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:06:35,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:06:35,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:06:35,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:06:35,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:06:35,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:06:35,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:06:35,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:06:35,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:06:35,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:06:35,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:06:35,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:06:35,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:06:35,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:06:35,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:06:35,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:06:35,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:06:35,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:06:35,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:06:35,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:06:35,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:06:35,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:06:35,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:06:35,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:06:35,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:06:35,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:06:35,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:06:35,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:06:35,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:06:35,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:06:35,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:06:35,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:06:35,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:06:35,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:06:35,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:06:35,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:06:35,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:06:35,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:06:35,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:06:35,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:06:35,454 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:06:35,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:06:35,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:06:35,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:06:35,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:06:35,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:06:35,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:06:35,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:06:35,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:06:35,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:06:35,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:06:35,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:06:35,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:06:35,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:06:35,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:06:35,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:06:35,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:06:35,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:35,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:06:35,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:06:35,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:06:35,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:06:35,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:06:35,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:06:35,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:06:35,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:06:35,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:06:35,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:06:35,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:06:35,784 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:06:35,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 03:06:35,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ced4a5c/cd8b564826914ec4a774611f6794fb73/FLAGe9a6bf6a0 [2019-12-27 03:06:36,407 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:06:36,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 03:06:36,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ced4a5c/cd8b564826914ec4a774611f6794fb73/FLAGe9a6bf6a0 [2019-12-27 03:06:36,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ced4a5c/cd8b564826914ec4a774611f6794fb73 [2019-12-27 03:06:36,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:06:36,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:06:36,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:36,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:06:36,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:06:36,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:36" (1/1) ... [2019-12-27 03:06:36,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da409ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:36, skipping insertion in model container [2019-12-27 03:06:36,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:36" (1/1) ... [2019-12-27 03:06:36,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:06:36,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:06:37,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:37,292 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:06:37,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:37,462 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:06:37,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37 WrapperNode [2019-12-27 03:06:37,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:37,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:37,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:06:37,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:06:37,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:37,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:06:37,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:06:37,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:06:37,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (1/1) ... [2019-12-27 03:06:37,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:06:37,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:06:37,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:06:37,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:06:37,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (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 03:06:37,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:06:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:06:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:06:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:06:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:06:37,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:06:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:06:37,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:06:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:06:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:06:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:06:37,708 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 03:06:38,391 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:06:38,392 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:06:38,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:38 BoogieIcfgContainer [2019-12-27 03:06:38,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:06:38,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:06:38,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:06:38,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:06:38,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:06:36" (1/3) ... [2019-12-27 03:06:38,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c867e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:38, skipping insertion in model container [2019-12-27 03:06:38,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:37" (2/3) ... [2019-12-27 03:06:38,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c867e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:38, skipping insertion in model container [2019-12-27 03:06:38,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:38" (3/3) ... [2019-12-27 03:06:38,407 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-27 03:06:38,419 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:06:38,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:06:38,432 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:06:38,433 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:06:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:38,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:06:38,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:06:38,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:06:38,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:06:38,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:06:38,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:06:38,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:06:38,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:06:38,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:06:38,645 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 03:06:38,647 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 03:06:38,736 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 03:06:38,736 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:38,752 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:38,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 03:06:38,819 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 03:06:38,819 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:38,825 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:38,840 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 03:06:38,841 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:06:43,128 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:06:43,257 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:06:43,657 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-27 03:06:43,657 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:06:43,661 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 03:06:44,376 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 03:06:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 03:06:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:06:44,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:44,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:06:44,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-27 03:06:44,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:44,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137600219] [2019-12-27 03:06:44,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:44,724 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 03:06:44,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137600219] [2019-12-27 03:06:44,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:44,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:06:44,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434246281] [2019-12-27 03:06:44,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:44,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:44,750 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 03:06:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:45,064 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-27 03:06:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:45,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:06:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:45,220 INFO L225 Difference]: With dead ends: 8506 [2019-12-27 03:06:45,220 INFO L226 Difference]: Without dead ends: 7522 [2019-12-27 03:06:45,221 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 03:06:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-27 03:06:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-27 03:06:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-27 03:06:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-27 03:06:45,737 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-27 03:06:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:45,738 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-27 03:06:45,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-27 03:06:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:06:45,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:45,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:45,742 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-27 03:06:45,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:45,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230645174] [2019-12-27 03:06:45,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:45,795 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 03:06:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230645174] [2019-12-27 03:06:45,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:45,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460223766] [2019-12-27 03:06:45,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:45,798 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-27 03:06:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:45,827 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-27 03:06:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:45,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:06:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:45,835 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 03:06:45,835 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 03:06:45,836 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 03:06:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 03:06:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 03:06:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 03:06:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-27 03:06:45,867 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-27 03:06:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:45,867 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-27 03:06:45,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-27 03:06:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:06:45,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:45,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:45,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-27 03:06:45,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:45,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738651886] [2019-12-27 03:06:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:45,923 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 03:06:45,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738651886] [2019-12-27 03:06:45,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:45,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:45,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608982740] [2019-12-27 03:06:45,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:45,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:45,926 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-27 03:06:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:46,030 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-27 03:06:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:46,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:06:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:46,044 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 03:06:46,044 INFO L226 Difference]: Without dead ends: 1960 [2019-12-27 03:06:46,044 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 03:06:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-27 03:06:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-27 03:06:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-27 03:06:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-27 03:06:46,100 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-27 03:06:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:46,100 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-27 03:06:46,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-27 03:06:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:06:46,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:46,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:46,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-27 03:06:46,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:46,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202529895] [2019-12-27 03:06:46,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:46,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 03:06:46,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202529895] [2019-12-27 03:06:46,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:46,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:46,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408331420] [2019-12-27 03:06:46,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:46,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:46,217 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-27 03:06:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:46,402 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-27 03:06:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:46,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:06:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:46,412 INFO L225 Difference]: With dead ends: 1706 [2019-12-27 03:06:46,412 INFO L226 Difference]: Without dead ends: 1706 [2019-12-27 03:06:46,413 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 03:06:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-27 03:06:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-27 03:06:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-27 03:06:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-27 03:06:46,456 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-27 03:06:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:46,457 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-27 03:06:46,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-27 03:06:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:06:46,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:46,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:46,459 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-27 03:06:46,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:46,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455404553] [2019-12-27 03:06:46,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:06:46,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455404553] [2019-12-27 03:06:46,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:46,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:46,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736256692] [2019-12-27 03:06:46,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:46,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:46,551 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-27 03:06:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:46,765 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-27 03:06:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:46,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:06:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:46,777 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 03:06:46,778 INFO L226 Difference]: Without dead ends: 2032 [2019-12-27 03:06:46,778 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 03:06:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-27 03:06:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-27 03:06:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-27 03:06:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-27 03:06:46,905 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-27 03:06:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:46,905 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-27 03:06:46,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-27 03:06:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:06:46,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:46,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:46,908 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-27 03:06:46,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:46,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534323419] [2019-12-27 03:06:46,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:46,977 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 03:06:46,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534323419] [2019-12-27 03:06:46,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873440690] [2019-12-27 03:06:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:46,981 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-27 03:06:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:47,232 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-27 03:06:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:06:47,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 03:06:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:47,258 INFO L225 Difference]: With dead ends: 2284 [2019-12-27 03:06:47,259 INFO L226 Difference]: Without dead ends: 2284 [2019-12-27 03:06:47,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:06:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-27 03:06:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-27 03:06:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 03:06:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-27 03:06:47,322 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-27 03:06:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:47,323 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-27 03:06:47,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-27 03:06:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:06:47,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:47,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:47,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-27 03:06:47,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:47,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127625439] [2019-12-27 03:06:47,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:47,418 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 03:06:47,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127625439] [2019-12-27 03:06:47,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:47,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:47,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126414739] [2019-12-27 03:06:47,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:47,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:47,422 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-27 03:06:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:47,475 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-27 03:06:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:47,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 03:06:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:47,500 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 03:06:47,500 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 03:06:47,501 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 03:06:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 03:06:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-27 03:06:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-27 03:06:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-27 03:06:47,570 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-27 03:06:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:47,571 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-27 03:06:47,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-27 03:06:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:06:47,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:47,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:47,574 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135588, now seen corresponding path program 1 times [2019-12-27 03:06:47,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:47,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416564839] [2019-12-27 03:06:47,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:06:47,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416564839] [2019-12-27 03:06:47,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:47,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:47,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355864454] [2019-12-27 03:06:47,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:47,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:47,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:47,657 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-27 03:06:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:47,680 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-27 03:06:47,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:47,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 03:06:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:47,684 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 03:06:47,685 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 03:06:47,685 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 03:06:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 03:06:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-27 03:06:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-27 03:06:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-27 03:06:47,719 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-27 03:06:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:47,720 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-27 03:06:47,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-27 03:06:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:06:47,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:47,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:47,722 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:47,723 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-27 03:06:47,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:47,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640947087] [2019-12-27 03:06:47,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:47,827 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 03:06:47,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640947087] [2019-12-27 03:06:47,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:47,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:47,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041017264] [2019-12-27 03:06:47,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:47,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:47,829 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-27 03:06:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:47,963 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-27 03:06:47,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:06:47,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 03:06:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:47,968 INFO L225 Difference]: With dead ends: 1416 [2019-12-27 03:06:47,968 INFO L226 Difference]: Without dead ends: 1416 [2019-12-27 03:06:47,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:06:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-27 03:06:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-27 03:06:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 03:06:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-27 03:06:47,998 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-27 03:06:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:47,999 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-27 03:06:47,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-27 03:06:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:06:48,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:48,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:48,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1828057274, now seen corresponding path program 1 times [2019-12-27 03:06:48,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:48,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569028547] [2019-12-27 03:06:48,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:48,086 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 03:06:48,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569028547] [2019-12-27 03:06:48,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:48,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:06:48,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067793576] [2019-12-27 03:06:48,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:48,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:48,088 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 5 states. [2019-12-27 03:06:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:48,607 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-27 03:06:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:06:48,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 03:06:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:48,612 INFO L225 Difference]: With dead ends: 2192 [2019-12-27 03:06:48,612 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 03:06:48,613 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 03:06:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 03:06:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-27 03:06:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 03:06:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-27 03:06:48,655 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-27 03:06:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:48,656 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-27 03:06:48,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-27 03:06:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:06:48,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:48,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:48,660 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1516082769, now seen corresponding path program 1 times [2019-12-27 03:06:48,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:48,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988814206] [2019-12-27 03:06:48,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:48,696 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 03:06:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988814206] [2019-12-27 03:06:48,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:48,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:48,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078497532] [2019-12-27 03:06:48,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:48,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:48,698 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 4 states. [2019-12-27 03:06:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:48,716 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-27 03:06:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:06:48,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 03:06:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:48,719 INFO L225 Difference]: With dead ends: 1109 [2019-12-27 03:06:48,719 INFO L226 Difference]: Without dead ends: 1001 [2019-12-27 03:06:48,719 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 03:06:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-27 03:06:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-27 03:06:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 03:06:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-27 03:06:48,738 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-27 03:06:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:48,738 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-27 03:06:48,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-27 03:06:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 03:06:48,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:48,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:48,741 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1905841279, now seen corresponding path program 1 times [2019-12-27 03:06:48,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:48,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257289548] [2019-12-27 03:06:48,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:48,847 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 03:06:48,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257289548] [2019-12-27 03:06:48,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:48,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:06:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126269115] [2019-12-27 03:06:48,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:06:48,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:06:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:06:48,852 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 7 states. [2019-12-27 03:06:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:49,046 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-27 03:06:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:06:49,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 03:06:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:49,049 INFO L225 Difference]: With dead ends: 1593 [2019-12-27 03:06:49,049 INFO L226 Difference]: Without dead ends: 1060 [2019-12-27 03:06:49,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:06:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-27 03:06:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-27 03:06:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-27 03:06:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-27 03:06:49,068 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-27 03:06:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:49,068 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-27 03:06:49,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:06:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-27 03:06:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 03:06:49,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:49,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:49,071 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1903876577, now seen corresponding path program 2 times [2019-12-27 03:06:49,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:49,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443427764] [2019-12-27 03:06:49,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:49,193 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 03:06:49,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443427764] [2019-12-27 03:06:49,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:49,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:06:49,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727951416] [2019-12-27 03:06:49,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:06:49,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:49,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:06:49,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:06:49,196 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 6 states. [2019-12-27 03:06:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:49,656 INFO L93 Difference]: Finished difference Result 1079 states and 2184 transitions. [2019-12-27 03:06:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:06:49,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 03:06:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:49,661 INFO L225 Difference]: With dead ends: 1079 [2019-12-27 03:06:49,661 INFO L226 Difference]: Without dead ends: 1079 [2019-12-27 03:06:49,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:06:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-27 03:06:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 952. [2019-12-27 03:06:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 03:06:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1941 transitions. [2019-12-27 03:06:49,681 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1941 transitions. Word has length 51 [2019-12-27 03:06:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:49,682 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1941 transitions. [2019-12-27 03:06:49,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:06:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1941 transitions. [2019-12-27 03:06:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 03:06:49,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:49,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:49,685 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623143, now seen corresponding path program 3 times [2019-12-27 03:06:49,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:49,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836154582] [2019-12-27 03:06:49,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:49,754 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 03:06:49,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836154582] [2019-12-27 03:06:49,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:49,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:49,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639488091] [2019-12-27 03:06:49,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:49,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:49,756 INFO L87 Difference]: Start difference. First operand 952 states and 1941 transitions. Second operand 3 states. [2019-12-27 03:06:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:49,801 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-27 03:06:49,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:49,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 03:06:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:49,804 INFO L225 Difference]: With dead ends: 1175 [2019-12-27 03:06:49,805 INFO L226 Difference]: Without dead ends: 1175 [2019-12-27 03:06:49,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-27 03:06:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-27 03:06:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 03:06:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-27 03:06:49,824 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-27 03:06:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:49,826 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-27 03:06:49,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-27 03:06:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:06:49,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:49,829 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 03:06:49,829 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1330853335, now seen corresponding path program 1 times [2019-12-27 03:06:49,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:49,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626770659] [2019-12-27 03:06:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:49,956 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 03:06:49,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626770659] [2019-12-27 03:06:49,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:49,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:49,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002813287] [2019-12-27 03:06:49,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:49,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:49,958 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 3 states. [2019-12-27 03:06:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:50,039 INFO L93 Difference]: Finished difference Result 931 states and 1918 transitions. [2019-12-27 03:06:50,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:50,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:06:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:50,042 INFO L225 Difference]: With dead ends: 931 [2019-12-27 03:06:50,042 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 03:06:50,042 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 03:06:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 03:06:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 814. [2019-12-27 03:06:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-12-27 03:06:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1697 transitions. [2019-12-27 03:06:50,057 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1697 transitions. Word has length 52 [2019-12-27 03:06:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:50,058 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1697 transitions. [2019-12-27 03:06:50,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1697 transitions. [2019-12-27 03:06:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:06:50,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:50,060 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 03:06:50,060 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 1 times [2019-12-27 03:06:50,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:50,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123830123] [2019-12-27 03:06:50,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:06:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:06:50,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:06:50,208 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:06:50,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31|)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_31|) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_31| 4)) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_23|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31| 1)) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31|) |v_ULTIMATE.start_main_~#t1601~0.offset_23| 0))) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_23|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:06:50,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1851235533)) (= ~x$r_buff1_thd2~0_Out1851235533 ~x$r_buff0_thd2~0_In1851235533) (= 1 ~x$r_buff0_thd1~0_Out1851235533) (= ~x$r_buff1_thd1~0_Out1851235533 ~x$r_buff0_thd1~0_In1851235533) (= ~x$r_buff1_thd0~0_Out1851235533 ~x$r_buff0_thd0~0_In1851235533) (= 1 ~y~0_Out1851235533)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1851235533, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1851235533, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1851235533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1851235533} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1851235533, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1851235533, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1851235533, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1851235533, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1851235533, ~y~0=~y~0_Out1851235533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1851235533, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1851235533} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:06:50,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-27 03:06:50,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2136379312 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2136379312 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-2136379312| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2136379312| ~x$w_buff0_used~0_In-2136379312)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2136379312, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136379312} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2136379312|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2136379312, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136379312} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:06:50,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1941957715 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1941957715 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1941957715 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1941957715 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1941957715| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1941957715| ~x$w_buff1_used~0_In-1941957715)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1941957715, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941957715, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1941957715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941957715} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1941957715|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1941957715, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941957715, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1941957715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941957715} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:06:50,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1194119694 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1194119694 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out1194119694 ~x$r_buff0_thd1~0_In1194119694)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out1194119694)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1194119694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1194119694} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1194119694, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1194119694|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1194119694} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:06:50,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1941874053 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1941874053 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1941874053 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1941874053 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In-1941874053 |P0Thread1of1ForFork0_#t~ite8_Out-1941874053|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1941874053|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1941874053, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941874053, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1941874053, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941874053} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1941874053, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1941874053|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1941874053, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1941874053, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1941874053} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:06:50,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} 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 03:06:50,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 03:06:50,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-315971546 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-315971546| |P1Thread1of1ForFork1_#t~ite29_Out-315971546|) (= ~x$r_buff1_thd2~0_In-315971546 |P1Thread1of1ForFork1_#t~ite30_Out-315971546|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-315971546| |P1Thread1of1ForFork1_#t~ite29_Out-315971546|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-315971546 256)))) (or (= (mod ~x$w_buff0_used~0_In-315971546 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-315971546 256) 0)) (and (= (mod ~x$w_buff1_used~0_In-315971546 256) 0) .cse1))) (= ~x$r_buff1_thd2~0_In-315971546 |P1Thread1of1ForFork1_#t~ite29_Out-315971546|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-315971546|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315971546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315971546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315971546, ~weak$$choice2~0=~weak$$choice2~0_In-315971546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315971546} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-315971546|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-315971546|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315971546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315971546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315971546, ~weak$$choice2~0=~weak$$choice2~0_In-315971546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315971546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:06:50,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 03:06:50,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1027988065 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1027988065 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1027988065| ~x$w_buff1~0_In1027988065) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1027988065| ~x~0_In1027988065)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1027988065, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1027988065, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1027988065, ~x~0=~x~0_In1027988065} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1027988065, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1027988065, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1027988065, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1027988065|, ~x~0=~x~0_In1027988065} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:06:50,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:06:50,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1427341982 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1427341982 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1427341982 |P1Thread1of1ForFork1_#t~ite34_Out1427341982|)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1427341982| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1427341982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1427341982} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1427341982|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1427341982, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1427341982} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:06:50,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1305380360 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1305380360 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1305380360 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1305380360 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1305380360 |P1Thread1of1ForFork1_#t~ite35_Out-1305380360|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1305380360|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1305380360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1305380360, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1305380360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1305380360} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1305380360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1305380360, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1305380360|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1305380360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1305380360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:06:50,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In164022229 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In164022229 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In164022229 |P1Thread1of1ForFork1_#t~ite36_Out164022229|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out164022229|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In164022229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In164022229} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In164022229, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out164022229|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In164022229} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:06:50,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In45425752 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In45425752 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In45425752 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In45425752 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out45425752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out45425752| ~x$r_buff1_thd2~0_In45425752)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In45425752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In45425752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In45425752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In45425752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In45425752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In45425752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In45425752, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out45425752|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In45425752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:06:50,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_24|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:06:50,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 03:06:50,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out955068142| |ULTIMATE.start_main_#t~ite40_Out955068142|)) (.cse2 (= (mod ~x$w_buff1_used~0_In955068142 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In955068142 256)))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In955068142 |ULTIMATE.start_main_#t~ite40_Out955068142|) (not .cse2)) (and (= ~x~0_In955068142 |ULTIMATE.start_main_#t~ite40_Out955068142|) .cse0 (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In955068142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955068142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955068142, ~x~0=~x~0_In955068142} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out955068142|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out955068142|, ~x$w_buff1~0=~x$w_buff1~0_In955068142, ~x$w_buff1_used~0=~x$w_buff1_used~0_In955068142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In955068142, ~x~0=~x~0_In955068142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 03:06:50,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1810548946 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1810548946 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1810548946| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1810548946| ~x$w_buff0_used~0_In-1810548946) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1810548946, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1810548946} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1810548946, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1810548946|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1810548946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:06:50,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In2102131667 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2102131667 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2102131667 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In2102131667 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out2102131667| ~x$w_buff1_used~0_In2102131667) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out2102131667| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2102131667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2102131667, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2102131667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2102131667} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2102131667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2102131667, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2102131667|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2102131667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2102131667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:06:50,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In956059601 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In956059601 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In956059601 |ULTIMATE.start_main_#t~ite44_Out956059601|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out956059601|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In956059601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956059601} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In956059601, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out956059601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956059601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:06:50,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-883927573 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-883927573 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-883927573 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-883927573 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-883927573|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-883927573| ~x$r_buff1_thd0~0_In-883927573)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-883927573, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-883927573, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-883927573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-883927573} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-883927573, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-883927573, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-883927573, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-883927573|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-883927573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:06:50,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:06:50,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:06:50 BasicIcfg [2019-12-27 03:06:50,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:06:50,370 INFO L168 Benchmark]: Toolchain (without parser) took 13685.23 ms. Allocated memory was 138.4 MB in the beginning and 462.4 MB in the end (delta: 324.0 MB). Free memory was 100.6 MB in the beginning and 322.1 MB in the end (delta: -221.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,371 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.24 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 155.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.79 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,373 INFO L168 Benchmark]: Boogie Preprocessor took 65.22 ms. Allocated memory is still 200.3 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,379 INFO L168 Benchmark]: RCFGBuilder took 763.49 ms. Allocated memory is still 200.3 MB. Free memory was 150.3 MB in the beginning and 105.6 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,380 INFO L168 Benchmark]: TraceAbstraction took 11969.58 ms. Allocated memory was 200.3 MB in the beginning and 462.4 MB in the end (delta: 262.1 MB). Free memory was 105.6 MB in the beginning and 322.1 MB in the end (delta: -216.5 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:50,390 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.24 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 155.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.79 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.22 ms. Allocated memory is still 200.3 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.49 ms. Allocated memory is still 200.3 MB. Free memory was 150.3 MB in the beginning and 105.6 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11969.58 ms. Allocated memory was 200.3 MB in the beginning and 462.4 MB in the end (delta: 262.1 MB). Free memory was 105.6 MB in the beginning and 322.1 MB in the end (delta: -216.5 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 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, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 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 [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1836 SDtfs, 1193 SDslu, 2937 SDs, 0 SdLazy, 1590 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 2728 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 65271 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...