/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/safe002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:25:31,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:25:31,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:25:31,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:25:31,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:25:31,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:25:31,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:25:31,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:25:31,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:25:31,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:25:31,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:25:31,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:25:31,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:25:31,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:25:31,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:25:31,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:25:31,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:25:31,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:25:31,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:25:31,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:25:31,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:25:31,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:25:31,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:25:31,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:25:31,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:25:31,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:25:31,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:25:31,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:25:31,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:25:31,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:25:31,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:25:31,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:25:31,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:25:31,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:25:31,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:25:31,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:25:31,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:25:31,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:25:31,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:25:31,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:25:31,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:25:31,436 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:25:31,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:25:31,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:25:31,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:25:31,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:25:31,476 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:25:31,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:25:31,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:25:31,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:25:31,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:25:31,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:25:31,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:25:31,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:25:31,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:25:31,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:25:31,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:25:31,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:25:31,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:25:31,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:25:31,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:25:31,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:25:31,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:25:31,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:25:31,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:25:31,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:25:31,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:25:31,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:25:31,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:25:31,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:25:31,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:25:31,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:25:31,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:25:31,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:25:31,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:25:31,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:25:31,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 03:25:31,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f223b918/3f3411e1457744df9245d259e02ad271/FLAG35931329d [2019-12-27 03:25:32,419 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:25:32,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 03:25:32,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f223b918/3f3411e1457744df9245d259e02ad271/FLAG35931329d [2019-12-27 03:25:32,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f223b918/3f3411e1457744df9245d259e02ad271 [2019-12-27 03:25:32,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:25:32,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:25:32,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:25:32,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:25:32,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:25:32,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:25:32" (1/1) ... [2019-12-27 03:25:32,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1785c967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:32, skipping insertion in model container [2019-12-27 03:25:32,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:25:32" (1/1) ... [2019-12-27 03:25:32,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:25:32,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:25:33,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:25:33,329 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:25:33,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:25:33,487 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:25:33,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33 WrapperNode [2019-12-27 03:25:33,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:25:33,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:25:33,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:25:33,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:25:33,499 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:25:33" (1/1) ... [2019-12-27 03:25:33,521 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:25:33" (1/1) ... [2019-12-27 03:25:33,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:25:33,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:25:33,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:25:33,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:25:33,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (1/1) ... [2019-12-27 03:25:33,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:25:33,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:25:33,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:25:33,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:25:33,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (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:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:25:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:25:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:25:33,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:25:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:25:33,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:25:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:25:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:25:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:25:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:25:33,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:25:33,686 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:25:34,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:25:34,379 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:25:34,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:25:34 BoogieIcfgContainer [2019-12-27 03:25:34,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:25:34,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:25:34,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:25:34,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:25:34,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:25:32" (1/3) ... [2019-12-27 03:25:34,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707107e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:25:34, skipping insertion in model container [2019-12-27 03:25:34,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:25:33" (2/3) ... [2019-12-27 03:25:34,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707107e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:25:34, skipping insertion in model container [2019-12-27 03:25:34,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:25:34" (3/3) ... [2019-12-27 03:25:34,389 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2019-12-27 03:25:34,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:25:34,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:25:34,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:25:34,407 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:25:34,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,449 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,498 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,498 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:25:34,535 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:25:34,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:25:34,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:25:34,553 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:25:34,553 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:25:34,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:25:34,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:25:34,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:25:34,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:25:34,569 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 03:25:34,571 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:25:34,667 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:25:34,667 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:25:34,682 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:25:34,705 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:25:34,755 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:25:34,755 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:25:34,763 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:25:34,783 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:25:34,784 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:25:40,230 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:25:40,364 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:25:40,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-27 03:25:40,387 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 03:25:40,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 03:25:50,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-27 03:25:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-27 03:25:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:25:50,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:25:50,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:25:50,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:25:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:25:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-27 03:25:50,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:25:50,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352182993] [2019-12-27 03:25:50,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:25:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:25:50,784 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:25:50,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352182993] [2019-12-27 03:25:50,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:25:50,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:25:50,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701404209] [2019-12-27 03:25:50,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:25:50,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:25:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:25:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:25:50,814 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-27 03:25:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:25:53,347 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-27 03:25:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:25:53,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:25:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:25:53,892 INFO L225 Difference]: With dead ends: 79498 [2019-12-27 03:25:53,893 INFO L226 Difference]: Without dead ends: 74626 [2019-12-27 03:25:53,894 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:25:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-27 03:26:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-27 03:26:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-27 03:26:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-27 03:26:03,548 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-27 03:26:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:03,548 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-27 03:26:03,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-27 03:26:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:26:03,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:03,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:03,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-27 03:26:03,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:03,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365332911] [2019-12-27 03:26:03,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:03,668 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:26:03,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365332911] [2019-12-27 03:26:03,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:03,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:26:03,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282658105] [2019-12-27 03:26:03,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:26:03,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:26:03,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:26:03,672 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-27 03:26:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:03,930 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-27 03:26:03,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:26:03,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:26:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:04,076 INFO L225 Difference]: With dead ends: 19918 [2019-12-27 03:26:04,076 INFO L226 Difference]: Without dead ends: 19918 [2019-12-27 03:26:04,078 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:26:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-27 03:26:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-27 03:26:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-27 03:26:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-27 03:26:04,608 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-27 03:26:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:04,609 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-27 03:26:04,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-27 03:26:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:26:04,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:04,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:04,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-27 03:26:04,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:04,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617985449] [2019-12-27 03:26:04,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:04,770 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:26:04,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617985449] [2019-12-27 03:26:04,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:04,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:26:04,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782824762] [2019-12-27 03:26:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:26:04,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:26:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:26:04,773 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-27 03:26:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:05,132 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-27 03:26:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:26:05,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:26:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:05,283 INFO L225 Difference]: With dead ends: 29603 [2019-12-27 03:26:05,284 INFO L226 Difference]: Without dead ends: 29589 [2019-12-27 03:26:05,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:26:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-27 03:26:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-27 03:26:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-27 03:26:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-27 03:26:06,621 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-27 03:26:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:06,622 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-27 03:26:06,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:26:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-27 03:26:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:26:06,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:06,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:06,625 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-27 03:26:06,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:06,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364887945] [2019-12-27 03:26:06,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:06,747 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:26:06,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364887945] [2019-12-27 03:26:06,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:06,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:26:06,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476193928] [2019-12-27 03:26:06,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:26:06,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:26:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:26:06,749 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-27 03:26:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:07,273 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-27 03:26:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:26:07,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:26:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:07,374 INFO L225 Difference]: With dead ends: 40028 [2019-12-27 03:26:07,374 INFO L226 Difference]: Without dead ends: 40010 [2019-12-27 03:26:07,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:26:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-27 03:26:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-27 03:26:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-27 03:26:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-27 03:26:08,619 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-27 03:26:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:08,620 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-27 03:26:08,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:26:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-27 03:26:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:26:08,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:08,630 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] [2019-12-27 03:26:08,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-27 03:26:08,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:08,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698623071] [2019-12-27 03:26:08,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:08,811 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:26:08,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698623071] [2019-12-27 03:26:08,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:08,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:26:08,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921089365] [2019-12-27 03:26:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:26:08,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:26:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:26:08,814 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-27 03:26:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:09,696 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-27 03:26:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:26:09,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:26:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:09,792 INFO L225 Difference]: With dead ends: 54414 [2019-12-27 03:26:09,792 INFO L226 Difference]: Without dead ends: 54384 [2019-12-27 03:26:09,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:26:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-27 03:26:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-27 03:26:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-27 03:26:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-27 03:26:10,926 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-27 03:26:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:10,926 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-27 03:26:10,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:26:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-27 03:26:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:26:10,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:10,936 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] [2019-12-27 03:26:10,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:10,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-27 03:26:10,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:10,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960952932] [2019-12-27 03:26:10,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:11,029 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:26:11,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960952932] [2019-12-27 03:26:11,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:11,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:26:11,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553987508] [2019-12-27 03:26:11,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:26:11,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:26:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:26:11,031 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-27 03:26:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:12,101 INFO L93 Difference]: Finished difference Result 56211 states and 182423 transitions. [2019-12-27 03:26:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:26:12,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 03:26:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:12,237 INFO L225 Difference]: With dead ends: 56211 [2019-12-27 03:26:12,237 INFO L226 Difference]: Without dead ends: 56181 [2019-12-27 03:26:12,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:26:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56181 states. [2019-12-27 03:26:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56181 to 35539. [2019-12-27 03:26:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35539 states. [2019-12-27 03:26:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35539 states to 35539 states and 117693 transitions. [2019-12-27 03:26:13,332 INFO L78 Accepts]: Start accepts. Automaton has 35539 states and 117693 transitions. Word has length 22 [2019-12-27 03:26:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:13,333 INFO L462 AbstractCegarLoop]: Abstraction has 35539 states and 117693 transitions. [2019-12-27 03:26:13,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:26:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35539 states and 117693 transitions. [2019-12-27 03:26:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:26:13,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:13,345 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:26:13,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-27 03:26:13,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:13,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296899707] [2019-12-27 03:26:13,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:13,406 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:26:13,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296899707] [2019-12-27 03:26:13,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:13,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:26:13,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424097371] [2019-12-27 03:26:13,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:26:13,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:26:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:26:13,408 INFO L87 Difference]: Start difference. First operand 35539 states and 117693 transitions. Second operand 4 states. [2019-12-27 03:26:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:13,476 INFO L93 Difference]: Finished difference Result 14114 states and 43412 transitions. [2019-12-27 03:26:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:26:13,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:26:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:13,496 INFO L225 Difference]: With dead ends: 14114 [2019-12-27 03:26:13,496 INFO L226 Difference]: Without dead ends: 14114 [2019-12-27 03:26:13,497 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:26:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-27 03:26:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 13924. [2019-12-27 03:26:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13924 states. [2019-12-27 03:26:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13924 states to 13924 states and 42859 transitions. [2019-12-27 03:26:13,695 INFO L78 Accepts]: Start accepts. Automaton has 13924 states and 42859 transitions. Word has length 25 [2019-12-27 03:26:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:13,695 INFO L462 AbstractCegarLoop]: Abstraction has 13924 states and 42859 transitions. [2019-12-27 03:26:13,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:26:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 13924 states and 42859 transitions. [2019-12-27 03:26:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:26:13,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:13,715 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] [2019-12-27 03:26:13,715 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-27 03:26:13,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:13,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394631937] [2019-12-27 03:26:13,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:13,785 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:26:13,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394631937] [2019-12-27 03:26:13,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:13,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:26:13,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260036017] [2019-12-27 03:26:13,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:26:13,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:26:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:26:13,788 INFO L87 Difference]: Start difference. First operand 13924 states and 42859 transitions. Second operand 3 states. [2019-12-27 03:26:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:13,840 INFO L93 Difference]: Finished difference Result 13923 states and 42857 transitions. [2019-12-27 03:26:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:26:13,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:26:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:13,860 INFO L225 Difference]: With dead ends: 13923 [2019-12-27 03:26:13,860 INFO L226 Difference]: Without dead ends: 13923 [2019-12-27 03:26:13,861 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:26:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-12-27 03:26:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-12-27 03:26:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-12-27 03:26:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 42857 transitions. [2019-12-27 03:26:14,059 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 42857 transitions. Word has length 39 [2019-12-27 03:26:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:14,060 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 42857 transitions. [2019-12-27 03:26:14,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 42857 transitions. [2019-12-27 03:26:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:26:14,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:14,081 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] [2019-12-27 03:26:14,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-27 03:26:14,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:14,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738873605] [2019-12-27 03:26:14,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:14,151 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:26:14,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738873605] [2019-12-27 03:26:14,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:14,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:26:14,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533701253] [2019-12-27 03:26:14,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:26:14,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:14,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:26:14,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:26:14,153 INFO L87 Difference]: Start difference. First operand 13923 states and 42857 transitions. Second operand 5 states. [2019-12-27 03:26:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:14,211 INFO L93 Difference]: Finished difference Result 12630 states and 39534 transitions. [2019-12-27 03:26:14,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:26:14,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:26:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:14,232 INFO L225 Difference]: With dead ends: 12630 [2019-12-27 03:26:14,232 INFO L226 Difference]: Without dead ends: 12630 [2019-12-27 03:26:14,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:26:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12630 states. [2019-12-27 03:26:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12630 to 12176. [2019-12-27 03:26:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-27 03:26:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 38245 transitions. [2019-12-27 03:26:14,557 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 38245 transitions. Word has length 40 [2019-12-27 03:26:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:14,557 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 38245 transitions. [2019-12-27 03:26:14,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:26:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 38245 transitions. [2019-12-27 03:26:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:14,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:14,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:14,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-27 03:26:14,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:14,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196546401] [2019-12-27 03:26:14,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:14,636 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:26:14,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196546401] [2019-12-27 03:26:14,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:14,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:26:14,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650548306] [2019-12-27 03:26:14,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:26:14,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:26:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:26:14,639 INFO L87 Difference]: Start difference. First operand 12176 states and 38245 transitions. Second operand 3 states. [2019-12-27 03:26:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:14,750 INFO L93 Difference]: Finished difference Result 16224 states and 51098 transitions. [2019-12-27 03:26:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:26:14,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:26:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:14,773 INFO L225 Difference]: With dead ends: 16224 [2019-12-27 03:26:14,774 INFO L226 Difference]: Without dead ends: 16224 [2019-12-27 03:26:14,774 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:26:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16224 states. [2019-12-27 03:26:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16224 to 13560. [2019-12-27 03:26:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-12-27 03:26:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 43108 transitions. [2019-12-27 03:26:14,992 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 43108 transitions. Word has length 54 [2019-12-27 03:26:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:14,993 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 43108 transitions. [2019-12-27 03:26:14,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 43108 transitions. [2019-12-27 03:26:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:15,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:15,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:15,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-27 03:26:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:15,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640059240] [2019-12-27 03:26:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:15,117 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:26:15,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640059240] [2019-12-27 03:26:15,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:15,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:26:15,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546312606] [2019-12-27 03:26:15,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:26:15,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:26:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:26:15,120 INFO L87 Difference]: Start difference. First operand 13560 states and 43108 transitions. Second operand 4 states. [2019-12-27 03:26:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:15,241 INFO L93 Difference]: Finished difference Result 25313 states and 80847 transitions. [2019-12-27 03:26:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:26:15,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 03:26:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:15,267 INFO L225 Difference]: With dead ends: 25313 [2019-12-27 03:26:15,268 INFO L226 Difference]: Without dead ends: 12650 [2019-12-27 03:26:15,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:26:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12650 states. [2019-12-27 03:26:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12650 to 12650. [2019-12-27 03:26:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12650 states. [2019-12-27 03:26:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12650 states to 12650 states and 40344 transitions. [2019-12-27 03:26:15,549 INFO L78 Accepts]: Start accepts. Automaton has 12650 states and 40344 transitions. Word has length 54 [2019-12-27 03:26:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:15,549 INFO L462 AbstractCegarLoop]: Abstraction has 12650 states and 40344 transitions. [2019-12-27 03:26:15,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:26:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12650 states and 40344 transitions. [2019-12-27 03:26:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:15,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:15,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:15,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-27 03:26:15,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:15,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820763814] [2019-12-27 03:26:15,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:15,633 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:26:15,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820763814] [2019-12-27 03:26:15,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:15,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:26:15,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407746278] [2019-12-27 03:26:15,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:26:15,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:26:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:26:15,635 INFO L87 Difference]: Start difference. First operand 12650 states and 40344 transitions. Second operand 4 states. [2019-12-27 03:26:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:15,759 INFO L93 Difference]: Finished difference Result 30768 states and 100350 transitions. [2019-12-27 03:26:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:26:15,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 03:26:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:15,771 INFO L225 Difference]: With dead ends: 30768 [2019-12-27 03:26:15,771 INFO L226 Difference]: Without dead ends: 5072 [2019-12-27 03:26:15,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:26:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-27 03:26:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-27 03:26:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-27 03:26:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-27 03:26:15,916 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-27 03:26:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:15,916 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-27 03:26:15,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:26:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-27 03:26:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:15,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:15,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:15,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-27 03:26:15,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:15,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211103284] [2019-12-27 03:26:15,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:16,008 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:26:16,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211103284] [2019-12-27 03:26:16,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:16,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:26:16,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118044794] [2019-12-27 03:26:16,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:26:16,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:26:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:26:16,010 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-27 03:26:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:16,365 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-27 03:26:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:26:16,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:26:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:16,378 INFO L225 Difference]: With dead ends: 9562 [2019-12-27 03:26:16,378 INFO L226 Difference]: Without dead ends: 6984 [2019-12-27 03:26:16,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:26:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-27 03:26:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-27 03:26:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-27 03:26:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-27 03:26:16,484 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-27 03:26:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:16,484 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-27 03:26:16,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:26:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-27 03:26:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:16,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:16,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:16,492 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-27 03:26:16,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384617735] [2019-12-27 03:26:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:16,585 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:26:16,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384617735] [2019-12-27 03:26:16,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:16,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:26:16,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621457780] [2019-12-27 03:26:16,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:26:16,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:26:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:26:16,587 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-27 03:26:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:16,912 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-27 03:26:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:26:16,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:26:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:16,935 INFO L225 Difference]: With dead ends: 11586 [2019-12-27 03:26:16,935 INFO L226 Difference]: Without dead ends: 8529 [2019-12-27 03:26:16,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:26:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-27 03:26:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-27 03:26:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-27 03:26:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-27 03:26:17,132 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-27 03:26:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:17,132 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-27 03:26:17,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:26:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-27 03:26:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:17,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:17,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:17,147 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-27 03:26:17,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:17,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094982574] [2019-12-27 03:26:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:17,229 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:26:17,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094982574] [2019-12-27 03:26:17,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:17,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:26:17,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655131116] [2019-12-27 03:26:17,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:26:17,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:26:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:26:17,231 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-27 03:26:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:17,563 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-27 03:26:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:26:17,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:26:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:17,586 INFO L225 Difference]: With dead ends: 16599 [2019-12-27 03:26:17,586 INFO L226 Difference]: Without dead ends: 14168 [2019-12-27 03:26:17,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:26:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-27 03:26:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-27 03:26:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-27 03:26:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-27 03:26:17,752 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-27 03:26:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:17,753 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-27 03:26:17,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:26:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-27 03:26:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:26:17,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:17,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:17,766 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-27 03:26:17,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:17,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780289165] [2019-12-27 03:26:17,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:17,845 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:26:17,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780289165] [2019-12-27 03:26:17,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:17,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:26:17,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316014383] [2019-12-27 03:26:17,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:26:17,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:26:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:26:17,847 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-27 03:26:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:17,886 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-27 03:26:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:26:17,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:26:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:17,899 INFO L225 Difference]: With dead ends: 6206 [2019-12-27 03:26:17,899 INFO L226 Difference]: Without dead ends: 6206 [2019-12-27 03:26:17,899 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:26:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-27 03:26:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-27 03:26:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-27 03:26:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-27 03:26:18,026 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-27 03:26:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:18,026 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-27 03:26:18,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-27 03:26:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:26:18,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:18,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:18,036 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-27 03:26:18,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:18,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561128513] [2019-12-27 03:26:18,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:18,131 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:26:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561128513] [2019-12-27 03:26:18,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:18,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:26:18,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753216153] [2019-12-27 03:26:18,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:26:18,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:26:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:26:18,133 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-27 03:26:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:18,167 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-27 03:26:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:26:18,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:26:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:18,179 INFO L225 Difference]: With dead ends: 5926 [2019-12-27 03:26:18,179 INFO L226 Difference]: Without dead ends: 5926 [2019-12-27 03:26:18,179 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:26:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-27 03:26:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-27 03:26:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-27 03:26:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-27 03:26:18,315 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-27 03:26:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:18,315 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-27 03:26:18,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:26:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-27 03:26:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:18,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:18,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:18,325 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-27 03:26:18,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:18,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52673503] [2019-12-27 03:26:18,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:18,672 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:26:18,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52673503] [2019-12-27 03:26:18,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:18,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:26:18,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501465764] [2019-12-27 03:26:18,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:26:18,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:26:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:26:18,674 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 11 states. [2019-12-27 03:26:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:20,812 INFO L93 Difference]: Finished difference Result 12166 states and 38531 transitions. [2019-12-27 03:26:20,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:26:20,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 03:26:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:20,826 INFO L225 Difference]: With dead ends: 12166 [2019-12-27 03:26:20,826 INFO L226 Difference]: Without dead ends: 8164 [2019-12-27 03:26:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-12-27 03:26:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8164 states. [2019-12-27 03:26:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8164 to 6482. [2019-12-27 03:26:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-12-27 03:26:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 20542 transitions. [2019-12-27 03:26:20,938 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 20542 transitions. Word has length 56 [2019-12-27 03:26:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:20,938 INFO L462 AbstractCegarLoop]: Abstraction has 6482 states and 20542 transitions. [2019-12-27 03:26:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:26:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 20542 transitions. [2019-12-27 03:26:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:20,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:20,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:20,946 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 290005151, now seen corresponding path program 2 times [2019-12-27 03:26:20,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:20,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929049519] [2019-12-27 03:26:20,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:21,229 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:26:21,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929049519] [2019-12-27 03:26:21,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:21,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:26:21,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426863282] [2019-12-27 03:26:21,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:26:21,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:26:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:26:21,232 INFO L87 Difference]: Start difference. First operand 6482 states and 20542 transitions. Second operand 12 states. [2019-12-27 03:26:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:23,503 INFO L93 Difference]: Finished difference Result 10311 states and 31974 transitions. [2019-12-27 03:26:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 03:26:23,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 03:26:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:23,517 INFO L225 Difference]: With dead ends: 10311 [2019-12-27 03:26:23,518 INFO L226 Difference]: Without dead ends: 8092 [2019-12-27 03:26:23,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:26:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2019-12-27 03:26:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 6376. [2019-12-27 03:26:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6376 states. [2019-12-27 03:26:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6376 states to 6376 states and 20233 transitions. [2019-12-27 03:26:23,633 INFO L78 Accepts]: Start accepts. Automaton has 6376 states and 20233 transitions. Word has length 56 [2019-12-27 03:26:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:23,633 INFO L462 AbstractCegarLoop]: Abstraction has 6376 states and 20233 transitions. [2019-12-27 03:26:23,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:26:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6376 states and 20233 transitions. [2019-12-27 03:26:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:23,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:23,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:23,641 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1558253649, now seen corresponding path program 3 times [2019-12-27 03:26:23,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:23,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105272155] [2019-12-27 03:26:23,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:23,864 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:26:23,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105272155] [2019-12-27 03:26:23,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:23,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:26:23,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849631902] [2019-12-27 03:26:23,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:26:23,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:26:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:26:23,866 INFO L87 Difference]: Start difference. First operand 6376 states and 20233 transitions. Second operand 11 states. [2019-12-27 03:26:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:25,632 INFO L93 Difference]: Finished difference Result 10990 states and 34029 transitions. [2019-12-27 03:26:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:26:25,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 03:26:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:25,647 INFO L225 Difference]: With dead ends: 10990 [2019-12-27 03:26:25,647 INFO L226 Difference]: Without dead ends: 8628 [2019-12-27 03:26:25,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:26:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2019-12-27 03:26:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 6664. [2019-12-27 03:26:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6664 states. [2019-12-27 03:26:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 21029 transitions. [2019-12-27 03:26:25,762 INFO L78 Accepts]: Start accepts. Automaton has 6664 states and 21029 transitions. Word has length 56 [2019-12-27 03:26:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:25,762 INFO L462 AbstractCegarLoop]: Abstraction has 6664 states and 21029 transitions. [2019-12-27 03:26:25,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:26:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6664 states and 21029 transitions. [2019-12-27 03:26:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:25,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:25,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:25,770 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash -672202313, now seen corresponding path program 4 times [2019-12-27 03:26:25,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:25,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763327584] [2019-12-27 03:26:25,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:26,033 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:26:26,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763327584] [2019-12-27 03:26:26,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:26,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:26:26,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709018654] [2019-12-27 03:26:26,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:26:26,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:26:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:26:26,035 INFO L87 Difference]: Start difference. First operand 6664 states and 21029 transitions. Second operand 12 states. [2019-12-27 03:26:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:27,827 INFO L93 Difference]: Finished difference Result 9600 states and 29756 transitions. [2019-12-27 03:26:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:26:27,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 03:26:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:27,841 INFO L225 Difference]: With dead ends: 9600 [2019-12-27 03:26:27,841 INFO L226 Difference]: Without dead ends: 8146 [2019-12-27 03:26:27,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 03:26:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8146 states. [2019-12-27 03:26:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8146 to 6232. [2019-12-27 03:26:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6232 states. [2019-12-27 03:26:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 19763 transitions. [2019-12-27 03:26:27,949 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 19763 transitions. Word has length 56 [2019-12-27 03:26:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:27,949 INFO L462 AbstractCegarLoop]: Abstraction has 6232 states and 19763 transitions. [2019-12-27 03:26:27,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:26:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 19763 transitions. [2019-12-27 03:26:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:27,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:27,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:27,957 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:27,957 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 5 times [2019-12-27 03:26:27,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:27,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618146723] [2019-12-27 03:26:27,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:28,285 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:26:28,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618146723] [2019-12-27 03:26:28,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:28,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:26:28,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049935348] [2019-12-27 03:26:28,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:26:28,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:28,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:26:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:26:28,288 INFO L87 Difference]: Start difference. First operand 6232 states and 19763 transitions. Second operand 11 states. [2019-12-27 03:26:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:29,129 INFO L93 Difference]: Finished difference Result 7722 states and 24262 transitions. [2019-12-27 03:26:29,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:26:29,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 03:26:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:29,143 INFO L225 Difference]: With dead ends: 7722 [2019-12-27 03:26:29,143 INFO L226 Difference]: Without dead ends: 7412 [2019-12-27 03:26:29,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:26:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2019-12-27 03:26:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 6736. [2019-12-27 03:26:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6736 states. [2019-12-27 03:26:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 21356 transitions. [2019-12-27 03:26:29,251 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 21356 transitions. Word has length 56 [2019-12-27 03:26:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:29,252 INFO L462 AbstractCegarLoop]: Abstraction has 6736 states and 21356 transitions. [2019-12-27 03:26:29,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:26:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 21356 transitions. [2019-12-27 03:26:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:29,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:29,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:29,259 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -392165105, now seen corresponding path program 6 times [2019-12-27 03:26:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:29,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911199972] [2019-12-27 03:26:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:26:29,897 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-12-27 03:26:30,112 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:26:30,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911199972] [2019-12-27 03:26:30,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:26:30,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:26:30,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918528668] [2019-12-27 03:26:30,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:26:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:26:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:26:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:26:30,114 INFO L87 Difference]: Start difference. First operand 6736 states and 21356 transitions. Second operand 16 states. [2019-12-27 03:26:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:26:31,481 INFO L93 Difference]: Finished difference Result 9182 states and 28086 transitions. [2019-12-27 03:26:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 03:26:31,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 03:26:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:26:31,495 INFO L225 Difference]: With dead ends: 9182 [2019-12-27 03:26:31,495 INFO L226 Difference]: Without dead ends: 7936 [2019-12-27 03:26:31,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:26:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-12-27 03:26:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 6848. [2019-12-27 03:26:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6848 states. [2019-12-27 03:26:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 21694 transitions. [2019-12-27 03:26:31,606 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 21694 transitions. Word has length 56 [2019-12-27 03:26:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:26:31,606 INFO L462 AbstractCegarLoop]: Abstraction has 6848 states and 21694 transitions. [2019-12-27 03:26:31,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:26:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 21694 transitions. [2019-12-27 03:26:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:26:31,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:26:31,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:26:31,614 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:26:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:26:31,614 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 7 times [2019-12-27 03:26:31,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:26:31,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215731334] [2019-12-27 03:26:31,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:26:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:26:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:26:31,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:26:31,717 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:26:31,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_39| 4)) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39|)) (= v_~main$tmp_guard1~0_61 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39| 1)) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_25|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1840~0.base_39|) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39|) |v_ULTIMATE.start_main_~#t1840~0.offset_25| 0))) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_39|, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_29|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~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, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~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_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:26:31,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-27 03:26:31,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-27 03:26:31,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:26:31,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-966033253 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-966033253 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-966033253 |P2Thread1of1ForFork1_#t~ite32_Out-966033253|)) (and (= ~x~0_In-966033253 |P2Thread1of1ForFork1_#t~ite32_Out-966033253|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-966033253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966033253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-966033253, ~x~0=~x~0_In-966033253} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-966033253|, ~x$w_buff1~0=~x$w_buff1~0_In-966033253, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966033253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-966033253, ~x~0=~x~0_In-966033253} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:26:31,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In5476760 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In5476760 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In5476760 |P1Thread1of1ForFork0_#t~ite28_Out5476760|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out5476760|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5476760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5476760} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5476760, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out5476760|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5476760} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:26:31,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:26:31,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2143439657 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2143439657 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out2143439657| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2143439657 |P2Thread1of1ForFork1_#t~ite34_Out2143439657|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2143439657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2143439657} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2143439657|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2143439657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2143439657} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:26:31,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1731900509 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1731900509 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1731900509 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1731900509 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1731900509|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1731900509 |P1Thread1of1ForFork0_#t~ite29_Out1731900509|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1731900509, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1731900509, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1731900509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1731900509, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1731900509, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1731900509, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1731900509|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:26:31,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1546350024 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1546350024 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1546350024 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1546350024 ~x$r_buff0_thd2~0_In-1546350024) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1546350024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546350024} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1546350024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1546350024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546350024} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:26:31,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1852135299 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1852135299 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1852135299 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1852135299 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1852135299| ~x$r_buff1_thd2~0_In1852135299)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out1852135299| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1852135299, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1852135299, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1852135299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852135299} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1852135299|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1852135299, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1852135299, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1852135299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1852135299} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:26:31,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:26:31,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-503931968 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-503931968 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-503931968 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-503931968 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-503931968 |P2Thread1of1ForFork1_#t~ite35_Out-503931968|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-503931968|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-503931968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-503931968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-503931968|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503931968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-503931968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:26:31,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1079725750 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1079725750 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In1079725750 |P2Thread1of1ForFork1_#t~ite36_Out1079725750|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1079725750|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1079725750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079725750} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1079725750|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1079725750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079725750} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:26:31,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1193438097 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-1193438097| |P0Thread1of1ForFork2_#t~ite11_Out-1193438097|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1193438097| ~x$w_buff1~0_In-1193438097)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1193438097| |P0Thread1of1ForFork2_#t~ite11_Out-1193438097|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1193438097 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1193438097 256))) (= 0 (mod ~x$w_buff0_used~0_In-1193438097 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1193438097 256) 0)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1193438097| ~x$w_buff1~0_In-1193438097)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1193438097, ~x$w_buff1~0=~x$w_buff1~0_In-1193438097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193438097, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1193438097, ~weak$$choice2~0=~weak$$choice2~0_In-1193438097, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1193438097|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193438097} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1193438097, ~x$w_buff1~0=~x$w_buff1~0_In-1193438097, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1193438097, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1193438097, ~weak$$choice2~0=~weak$$choice2~0_In-1193438097, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1193438097|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1193438097|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1193438097} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:26:31,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-423766837 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out-423766837| |P0Thread1of1ForFork2_#t~ite15_Out-423766837|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-423766837 256)))) (or (= (mod ~x$w_buff0_used~0_In-423766837 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-423766837 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-423766837 256) 0)))) (= ~x$w_buff0_used~0_In-423766837 |P0Thread1of1ForFork2_#t~ite14_Out-423766837|)) (and (= ~x$w_buff0_used~0_In-423766837 |P0Thread1of1ForFork2_#t~ite15_Out-423766837|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-423766837| |P0Thread1of1ForFork2_#t~ite14_Out-423766837|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-423766837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-423766837, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-423766837, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-423766837|, ~weak$$choice2~0=~weak$$choice2~0_In-423766837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-423766837} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-423766837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-423766837, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-423766837|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-423766837, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-423766837|, ~weak$$choice2~0=~weak$$choice2~0_In-423766837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-423766837} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:26:31,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:26:31,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-427778829 256)))) (or (and (= ~x$r_buff1_thd1~0_In-427778829 |P0Thread1of1ForFork2_#t~ite23_Out-427778829|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-427778829 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-427778829 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-427778829 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-427778829 256))))) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out-427778829| |P0Thread1of1ForFork2_#t~ite23_Out-427778829|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-427778829| ~x$r_buff1_thd1~0_In-427778829) (= |P0Thread1of1ForFork2_#t~ite23_In-427778829| |P0Thread1of1ForFork2_#t~ite23_Out-427778829|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-427778829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427778829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427778829, ~weak$$choice2~0=~weak$$choice2~0_In-427778829, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-427778829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427778829} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-427778829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427778829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427778829, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-427778829|, ~weak$$choice2~0=~weak$$choice2~0_In-427778829, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-427778829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427778829} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 03:26:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:26:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-590278304 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-590278304 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-590278304 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-590278304 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-590278304| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-590278304| ~x$r_buff1_thd3~0_In-590278304)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-590278304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590278304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-590278304|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-590278304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590278304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:26:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:26:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:26:31,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1667952923 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out1667952923| |ULTIMATE.start_main_#t~ite41_Out1667952923|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1667952923 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out1667952923| ~x~0_In1667952923)) (and (not .cse0) (= ~x$w_buff1~0_In1667952923 |ULTIMATE.start_main_#t~ite41_Out1667952923|) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1667952923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667952923, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1667952923, ~x~0=~x~0_In1667952923} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1667952923|, ~x$w_buff1~0=~x$w_buff1~0_In1667952923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1667952923, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1667952923, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1667952923|, ~x~0=~x~0_In1667952923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:26:31,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In399693804 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In399693804 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out399693804|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out399693804| ~x$w_buff0_used~0_In399693804)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In399693804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In399693804, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out399693804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:26:31,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1274635185 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1274635185 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1274635185 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1274635185 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1274635185 |ULTIMATE.start_main_#t~ite44_Out-1274635185|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1274635185|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1274635185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1274635185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1274635185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1274635185} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1274635185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1274635185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1274635185, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1274635185|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1274635185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:26:31,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2145822420 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2145822420 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-2145822420 |ULTIMATE.start_main_#t~ite45_Out-2145822420|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2145822420|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2145822420, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145822420} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2145822420, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2145822420|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145822420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:26:31,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1279462671 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1279462671 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1279462671 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1279462671 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1279462671| ~x$r_buff1_thd0~0_In-1279462671) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1279462671| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1279462671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1279462671, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1279462671|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:26:31,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:26:31,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:26:31 BasicIcfg [2019-12-27 03:26:31,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:26:31,853 INFO L168 Benchmark]: Toolchain (without parser) took 59165.91 ms. Allocated memory was 138.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 101.6 MB in the beginning and 981.2 MB in the end (delta: -879.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 03:26:31,854 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 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:26:31,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.39 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:26:31,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:26:31,856 INFO L168 Benchmark]: Boogie Preprocessor took 50.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 150.6 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:26:31,858 INFO L168 Benchmark]: RCFGBuilder took 766.85 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 103.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:26:31,859 INFO L168 Benchmark]: TraceAbstraction took 57470.24 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.3 MB in the beginning and 981.2 MB in the end (delta: -877.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 03:26:31,865 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.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.39 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.85 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 103.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57470.24 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.3 MB in the beginning and 981.2 MB in the end (delta: -877.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3962 SDtfs, 5241 SDslu, 14490 SDs, 0 SdLazy, 10162 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 27 SyntacticMatches, 21 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred 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: 17.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 70803 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 256900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...