/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:21,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:21,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:21,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:21,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:21,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:21,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:21,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:21,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:21,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:21,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:21,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:21,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:21,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:21,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:21,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:21,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:21,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:21,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:21,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:21,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:21,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:21,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:21,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:21,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:21,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:21,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:21,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:21,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:21,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:21,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:21,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:21,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:21,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:21,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:21,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:21,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:21,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:21,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:21,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:21,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:21,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:43:21,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:21,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:21,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:21,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:21,439 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:21,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:21,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:21,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:21,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:21,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:21,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:21,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:21,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:21,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:21,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:21,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:21,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:21,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:21,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:21,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:21,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:21,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:21,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:21,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:21,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:21,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:21,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:21,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:21,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:21,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:21,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:21,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:21,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:21,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:21,766 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:21,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-26 23:43:21,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f6c4485/a24eabb546854507a2009934cc2a07a0/FLAG352bfd579 [2019-12-26 23:43:22,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:22,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-26 23:43:22,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f6c4485/a24eabb546854507a2009934cc2a07a0/FLAG352bfd579 [2019-12-26 23:43:22,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f6c4485/a24eabb546854507a2009934cc2a07a0 [2019-12-26 23:43:22,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:22,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:22,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:22,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:22,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:22,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:22" (1/1) ... [2019-12-26 23:43:22,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76182f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:22, skipping insertion in model container [2019-12-26 23:43:22,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:22" (1/1) ... [2019-12-26 23:43:22,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:22,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:23,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:23,364 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:23,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:23,503 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:23,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23 WrapperNode [2019-12-26 23:43:23,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:23,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:23,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:23,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:23,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:23,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:23,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:23,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:23,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (1/1) ... [2019-12-26 23:43:23,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:23,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:23,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:23,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:23,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (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-26 23:43:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:23,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:23,675 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:43:24,420 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:24,421 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:24,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:24 BoogieIcfgContainer [2019-12-26 23:43:24,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:24,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:24,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:24,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:24,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:22" (1/3) ... [2019-12-26 23:43:24,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6151d6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:24, skipping insertion in model container [2019-12-26 23:43:24,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:23" (2/3) ... [2019-12-26 23:43:24,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6151d6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:24, skipping insertion in model container [2019-12-26 23:43:24,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:24" (3/3) ... [2019-12-26 23:43:24,431 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.opt.i [2019-12-26 23:43:24,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:24,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:24,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:24,449 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,558 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,558 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:24,583 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:24,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:24,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:24,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:24,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:24,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:24,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:24,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:24,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:24,623 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:43:24,625 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:24,760 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:24,760 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:24,775 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 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:24,796 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:24,846 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:24,847 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:24,854 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 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:24,874 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:24,875 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:30,333 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:43:30,444 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:43:30,551 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-26 23:43:30,551 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:43:30,555 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:43:42,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:43:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:43:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:42,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:42,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:42,052 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-26 23:43:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-26 23:43:42,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:42,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938125388] [2019-12-26 23:43:42,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:42,316 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-26 23:43:42,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938125388] [2019-12-26 23:43:42,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:42,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:42,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595095359] [2019-12-26 23:43:42,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:42,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:42,336 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:43:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:45,626 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:43:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:45,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:46,319 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:43:46,319 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:43:46,320 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-26 23:43:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:43:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:43:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:43:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:43:53,895 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:43:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:53,896 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:43:53,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:43:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:53,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:53,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:53,905 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-26 23:43:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-26 23:43:53,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:53,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762837957] [2019-12-26 23:43:53,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:54,011 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-26 23:43:54,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762837957] [2019-12-26 23:43:54,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:54,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:54,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144416742] [2019-12-26 23:43:54,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:54,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:54,014 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:43:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:57,855 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:43:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:57,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:58,298 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:43:58,299 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:43:58,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:44:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:44:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:44:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:44:10,461 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:44:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:10,462 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:44:10,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:44:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:44:10,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:10,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:10,466 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-26 23:44:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-26 23:44:10,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:10,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604497735] [2019-12-26 23:44:10,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:10,547 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-26 23:44:10,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604497735] [2019-12-26 23:44:10,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:10,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917642117] [2019-12-26 23:44:10,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:10,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:10,550 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:44:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:16,103 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-26 23:44:16,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:16,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:16,794 INFO L225 Difference]: With dead ends: 159677 [2019-12-26 23:44:16,794 INFO L226 Difference]: Without dead ends: 159565 [2019-12-26 23:44:16,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-26 23:44:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-26 23:44:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-26 23:44:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-26 23:44:24,361 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-26 23:44:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:24,361 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-26 23:44:24,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-26 23:44:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:24,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:24,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:24,365 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-26 23:44:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-26 23:44:24,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:24,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775913901] [2019-12-26 23:44:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:24,444 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-26 23:44:24,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775913901] [2019-12-26 23:44:24,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:24,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:24,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559112822] [2019-12-26 23:44:24,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:24,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:24,447 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-26 23:44:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:25,324 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-26 23:44:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:25,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:44:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:32,174 INFO L225 Difference]: With dead ends: 181618 [2019-12-26 23:44:32,175 INFO L226 Difference]: Without dead ends: 181618 [2019-12-26 23:44:32,175 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-26 23:44:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-26 23:44:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-26 23:44:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-26 23:44:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-26 23:44:39,313 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-26 23:44:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:39,313 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-26 23:44:39,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-26 23:44:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:39,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:39,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:39,318 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-26 23:44:39,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-26 23:44:39,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:39,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952687139] [2019-12-26 23:44:39,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:39,405 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-26 23:44:39,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952687139] [2019-12-26 23:44:39,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:39,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:39,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682913008] [2019-12-26 23:44:39,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:39,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:39,409 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-26 23:44:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:41,502 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-26 23:44:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:41,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:44:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:42,046 INFO L225 Difference]: With dead ends: 179622 [2019-12-26 23:44:42,047 INFO L226 Difference]: Without dead ends: 179542 [2019-12-26 23:44:42,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-26 23:44:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-26 23:44:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-26 23:44:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-26 23:44:57,597 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-26 23:44:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:57,597 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-26 23:44:57,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-26 23:44:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:57,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:57,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:57,602 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-26 23:44:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-26 23:44:57,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:57,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063449739] [2019-12-26 23:44:57,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:57,677 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-26 23:44:57,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063449739] [2019-12-26 23:44:57,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:57,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:57,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414982210] [2019-12-26 23:44:57,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:57,680 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-26 23:45:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:04,230 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-26 23:45:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:04,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:45:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:04,803 INFO L225 Difference]: With dead ends: 189091 [2019-12-26 23:45:04,803 INFO L226 Difference]: Without dead ends: 188995 [2019-12-26 23:45:04,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-26 23:45:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-26 23:45:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-26 23:45:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-26 23:45:13,359 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-26 23:45:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:13,360 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-26 23:45:13,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-26 23:45:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:45:13,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:13,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:13,380 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-26 23:45:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-26 23:45:13,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:13,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734141153] [2019-12-26 23:45:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:13,431 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-26 23:45:13,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734141153] [2019-12-26 23:45:13,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:13,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:45:13,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323440589] [2019-12-26 23:45:13,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:13,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:13,434 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-26 23:45:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:14,223 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-26 23:45:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:14,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:45:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:20,962 INFO L225 Difference]: With dead ends: 160940 [2019-12-26 23:45:20,963 INFO L226 Difference]: Without dead ends: 160940 [2019-12-26 23:45:20,963 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-26 23:45:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-26 23:45:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-26 23:45:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-26 23:45:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-26 23:45:28,285 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-26 23:45:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:28,286 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-26 23:45:28,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-26 23:45:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:28,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:28,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:28,307 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-26 23:45:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-26 23:45:28,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:28,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748860958] [2019-12-26 23:45:28,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:28,359 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-26 23:45:28,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748860958] [2019-12-26 23:45:28,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656672574] [2019-12-26 23:45:28,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:28,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:28,361 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-26 23:45:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:34,790 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-26 23:45:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:34,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:35,181 INFO L225 Difference]: With dead ends: 255238 [2019-12-26 23:45:35,182 INFO L226 Difference]: Without dead ends: 128270 [2019-12-26 23:45:35,182 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-26 23:45:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-26 23:45:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-26 23:45:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-26 23:45:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-26 23:45:45,880 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-26 23:45:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:45,880 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-26 23:45:45,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-26 23:45:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:45,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:45,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:45,894 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-26 23:45:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-26 23:45:45,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:45,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189030162] [2019-12-26 23:45:45,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:45,964 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-26 23:45:45,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189030162] [2019-12-26 23:45:45,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:45,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:45,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623982634] [2019-12-26 23:45:45,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:45,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:45,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:45,966 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-26 23:45:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:46,162 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-26 23:45:46,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:46,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:46,213 INFO L225 Difference]: With dead ends: 36423 [2019-12-26 23:45:46,213 INFO L226 Difference]: Without dead ends: 28545 [2019-12-26 23:45:46,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-26 23:45:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-26 23:45:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-26 23:45:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-26 23:45:47,657 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-26 23:45:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:47,658 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-26 23:45:47,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-26 23:45:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:47,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:47,663 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-26 23:45:47,663 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-26 23:45:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-26 23:45:47,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:47,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2783615] [2019-12-26 23:45:47,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:47,725 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-26 23:45:47,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2783615] [2019-12-26 23:45:47,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:47,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:47,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662944495] [2019-12-26 23:45:47,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:47,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:47,727 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-26 23:45:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:48,170 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-26 23:45:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:48,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:48,230 INFO L225 Difference]: With dead ends: 37265 [2019-12-26 23:45:48,231 INFO L226 Difference]: Without dead ends: 36963 [2019-12-26 23:45:48,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-26 23:45:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-26 23:45:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-26 23:45:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-26 23:45:48,820 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-26 23:45:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:48,820 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-26 23:45:48,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-26 23:45:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:48,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:48,827 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-26 23:45:48,827 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-26 23:45:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-26 23:45:48,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:48,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458914560] [2019-12-26 23:45:48,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:48,895 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-26 23:45:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458914560] [2019-12-26 23:45:48,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:48,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:48,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461114610] [2019-12-26 23:45:48,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:48,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:48,897 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-26 23:45:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:50,923 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-26 23:45:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:50,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:50,981 INFO L225 Difference]: With dead ends: 37362 [2019-12-26 23:45:50,981 INFO L226 Difference]: Without dead ends: 36942 [2019-12-26 23:45:50,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-26 23:45:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-26 23:45:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 23:45:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-26 23:45:51,525 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-26 23:45:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:51,525 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-26 23:45:51,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-26 23:45:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:45:51,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:51,533 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-26 23:45:51,534 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-26 23:45:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-26 23:45:51,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:51,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114772240] [2019-12-26 23:45:51,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:51,627 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-26 23:45:51,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114772240] [2019-12-26 23:45:51,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:51,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:51,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858812752] [2019-12-26 23:45:51,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:51,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:51,629 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-26 23:45:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:51,975 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-26 23:45:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:51,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:45:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:52,019 INFO L225 Difference]: With dead ends: 28874 [2019-12-26 23:45:52,019 INFO L226 Difference]: Without dead ends: 28434 [2019-12-26 23:45:52,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-26 23:45:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-26 23:45:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-26 23:45:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-26 23:45:52,813 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-26 23:45:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:52,813 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-26 23:45:52,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-26 23:45:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:52,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:52,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:52,827 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-26 23:45:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-26 23:45:52,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:52,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306022818] [2019-12-26 23:45:52,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:52,918 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-26 23:45:52,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306022818] [2019-12-26 23:45:52,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:52,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:52,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513819590] [2019-12-26 23:45:52,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:52,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:52,920 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-26 23:45:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:53,309 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-26 23:45:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:53,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:45:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:53,367 INFO L225 Difference]: With dead ends: 37145 [2019-12-26 23:45:53,367 INFO L226 Difference]: Without dead ends: 36771 [2019-12-26 23:45:53,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-26 23:45:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-26 23:45:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-26 23:45:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-26 23:45:53,902 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-26 23:45:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:53,903 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-26 23:45:53,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-26 23:45:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:53,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:53,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:53,916 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-26 23:45:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-26 23:45:53,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:53,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566877420] [2019-12-26 23:45:53,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:53,953 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-26 23:45:53,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566877420] [2019-12-26 23:45:53,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:53,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:53,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640482379] [2019-12-26 23:45:53,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:53,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:53,955 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-26 23:45:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:54,133 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-26 23:45:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:54,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 23:45:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:54,199 INFO L225 Difference]: With dead ends: 38320 [2019-12-26 23:45:54,199 INFO L226 Difference]: Without dead ends: 38320 [2019-12-26 23:45:54,201 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-26 23:45:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-26 23:45:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-26 23:45:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-26 23:45:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-26 23:45:55,077 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-26 23:45:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-26 23:45:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-26 23:45:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:45:55,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:55,093 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] [2019-12-26 23:45:55,093 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-26 23:45:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-26 23:45:55,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:55,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915182809] [2019-12-26 23:45:55,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:55,162 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-26 23:45:55,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915182809] [2019-12-26 23:45:55,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:55,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:55,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315308739] [2019-12-26 23:45:55,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:55,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:55,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:55,164 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-26 23:45:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:55,263 INFO L93 Difference]: Finished difference Result 13943 states and 42204 transitions. [2019-12-26 23:45:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:55,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:45:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,279 INFO L225 Difference]: With dead ends: 13943 [2019-12-26 23:45:55,279 INFO L226 Difference]: Without dead ends: 11902 [2019-12-26 23:45:55,280 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-26 23:45:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-12-26 23:45:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 11659. [2019-12-26 23:45:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11659 states. [2019-12-26 23:45:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11659 states to 11659 states and 35037 transitions. [2019-12-26 23:45:55,443 INFO L78 Accepts]: Start accepts. Automaton has 11659 states and 35037 transitions. Word has length 29 [2019-12-26 23:45:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:55,444 INFO L462 AbstractCegarLoop]: Abstraction has 11659 states and 35037 transitions. [2019-12-26 23:45:55,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 11659 states and 35037 transitions. [2019-12-26 23:45:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:45:55,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:55,458 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-26 23:45:55,458 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-26 23:45:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1034846780, now seen corresponding path program 1 times [2019-12-26 23:45:55,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:55,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316703968] [2019-12-26 23:45:55,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:55,498 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-26 23:45:55,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316703968] [2019-12-26 23:45:55,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:55,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:55,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232859445] [2019-12-26 23:45:55,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:55,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:55,503 INFO L87 Difference]: Start difference. First operand 11659 states and 35037 transitions. Second operand 3 states. [2019-12-26 23:45:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:55,578 INFO L93 Difference]: Finished difference Result 17927 states and 54340 transitions. [2019-12-26 23:45:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:55,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 23:45:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,591 INFO L225 Difference]: With dead ends: 17927 [2019-12-26 23:45:55,592 INFO L226 Difference]: Without dead ends: 7017 [2019-12-26 23:45:55,592 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-26 23:45:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2019-12-26 23:45:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 6687. [2019-12-26 23:45:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2019-12-26 23:45:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 20326 transitions. [2019-12-26 23:45:55,783 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 20326 transitions. Word has length 39 [2019-12-26 23:45:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:55,784 INFO L462 AbstractCegarLoop]: Abstraction has 6687 states and 20326 transitions. [2019-12-26 23:45:55,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 20326 transitions. [2019-12-26 23:45:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:55,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:55,797 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-26 23:45:55,797 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-26 23:45:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-26 23:45:55,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:55,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707903285] [2019-12-26 23:45:55,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:55,909 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-26 23:45:55,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707903285] [2019-12-26 23:45:55,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:55,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:55,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583115660] [2019-12-26 23:45:55,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:55,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:55,911 INFO L87 Difference]: Start difference. First operand 6687 states and 20326 transitions. Second operand 6 states. [2019-12-26 23:45:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:56,012 INFO L93 Difference]: Finished difference Result 5718 states and 17881 transitions. [2019-12-26 23:45:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:56,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:56,023 INFO L225 Difference]: With dead ends: 5718 [2019-12-26 23:45:56,024 INFO L226 Difference]: Without dead ends: 5217 [2019-12-26 23:45:56,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-12-26 23:45:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 5217. [2019-12-26 23:45:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5217 states. [2019-12-26 23:45:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 16852 transitions. [2019-12-26 23:45:56,143 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 16852 transitions. Word has length 40 [2019-12-26 23:45:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:56,144 INFO L462 AbstractCegarLoop]: Abstraction has 5217 states and 16852 transitions. [2019-12-26 23:45:56,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 16852 transitions. [2019-12-26 23:45:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:45:56,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:56,150 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-26 23:45:56,150 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-26 23:45:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1051329167, now seen corresponding path program 1 times [2019-12-26 23:45:56,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:56,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919517522] [2019-12-26 23:45:56,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:56,227 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-26 23:45:56,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919517522] [2019-12-26 23:45:56,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:56,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:56,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051348542] [2019-12-26 23:45:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:56,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:56,233 INFO L87 Difference]: Start difference. First operand 5217 states and 16852 transitions. Second operand 7 states. [2019-12-26 23:45:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:56,461 INFO L93 Difference]: Finished difference Result 9832 states and 31193 transitions. [2019-12-26 23:45:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:45:56,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-26 23:45:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:56,478 INFO L225 Difference]: With dead ends: 9832 [2019-12-26 23:45:56,478 INFO L226 Difference]: Without dead ends: 7108 [2019-12-26 23:45:56,482 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-26 23:45:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7108 states. [2019-12-26 23:45:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7108 to 6462. [2019-12-26 23:45:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2019-12-26 23:45:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 20772 transitions. [2019-12-26 23:45:56,668 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 20772 transitions. Word has length 54 [2019-12-26 23:45:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 6462 states and 20772 transitions. [2019-12-26 23:45:56,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 20772 transitions. [2019-12-26 23:45:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:45:56,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:56,677 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-26 23:45:56,677 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-26 23:45:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash -804799887, now seen corresponding path program 2 times [2019-12-26 23:45:56,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:56,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143642934] [2019-12-26 23:45:56,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:56,874 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-26 23:45:56,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143642934] [2019-12-26 23:45:56,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:56,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:56,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401678028] [2019-12-26 23:45:56,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:56,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:56,876 INFO L87 Difference]: Start difference. First operand 6462 states and 20772 transitions. Second operand 7 states. [2019-12-26 23:45:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:57,130 INFO L93 Difference]: Finished difference Result 11964 states and 37585 transitions. [2019-12-26 23:45:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:45:57,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-26 23:45:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:57,148 INFO L225 Difference]: With dead ends: 11964 [2019-12-26 23:45:57,149 INFO L226 Difference]: Without dead ends: 8727 [2019-12-26 23:45:57,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8727 states. [2019-12-26 23:45:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8727 to 7899. [2019-12-26 23:45:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7899 states. [2019-12-26 23:45:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 25111 transitions. [2019-12-26 23:45:57,304 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 25111 transitions. Word has length 54 [2019-12-26 23:45:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:57,304 INFO L462 AbstractCegarLoop]: Abstraction has 7899 states and 25111 transitions. [2019-12-26 23:45:57,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 25111 transitions. [2019-12-26 23:45:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:45:57,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:57,314 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-26 23:45:57,314 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-26 23:45:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1606219021, now seen corresponding path program 3 times [2019-12-26 23:45:57,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:57,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100849372] [2019-12-26 23:45:57,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:57,419 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-26 23:45:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100849372] [2019-12-26 23:45:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:45:57,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605606458] [2019-12-26 23:45:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:45:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:45:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:57,421 INFO L87 Difference]: Start difference. First operand 7899 states and 25111 transitions. Second operand 8 states. [2019-12-26 23:45:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:58,056 INFO L93 Difference]: Finished difference Result 12351 states and 38249 transitions. [2019-12-26 23:45:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:45:58,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-26 23:45:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:58,074 INFO L225 Difference]: With dead ends: 12351 [2019-12-26 23:45:58,074 INFO L226 Difference]: Without dead ends: 11075 [2019-12-26 23:45:58,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:45:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11075 states. [2019-12-26 23:45:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11075 to 7919. [2019-12-26 23:45:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7919 states. [2019-12-26 23:45:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7919 states to 7919 states and 25118 transitions. [2019-12-26 23:45:58,225 INFO L78 Accepts]: Start accepts. Automaton has 7919 states and 25118 transitions. Word has length 54 [2019-12-26 23:45:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:58,225 INFO L462 AbstractCegarLoop]: Abstraction has 7919 states and 25118 transitions. [2019-12-26 23:45:58,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:45:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7919 states and 25118 transitions. [2019-12-26 23:45:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:45:58,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:58,236 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-26 23:45:58,236 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-26 23:45:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -960363441, now seen corresponding path program 4 times [2019-12-26 23:45:58,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:58,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569797832] [2019-12-26 23:45:58,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:58,343 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-26 23:45:58,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569797832] [2019-12-26 23:45:58,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:58,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:58,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018816612] [2019-12-26 23:45:58,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:58,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:58,346 INFO L87 Difference]: Start difference. First operand 7919 states and 25118 transitions. Second operand 9 states. [2019-12-26 23:45:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:59,274 INFO L93 Difference]: Finished difference Result 14999 states and 46397 transitions. [2019-12-26 23:45:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:45:59,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 23:45:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:59,295 INFO L225 Difference]: With dead ends: 14999 [2019-12-26 23:45:59,296 INFO L226 Difference]: Without dead ends: 13723 [2019-12-26 23:45:59,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:45:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13723 states. [2019-12-26 23:45:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13723 to 7779. [2019-12-26 23:45:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-26 23:45:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 24697 transitions. [2019-12-26 23:45:59,455 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 24697 transitions. Word has length 54 [2019-12-26 23:45:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:59,455 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 24697 transitions. [2019-12-26 23:45:59,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 24697 transitions. [2019-12-26 23:45:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:45:59,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:59,465 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-26 23:45:59,465 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-26 23:45:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1713990903, now seen corresponding path program 5 times [2019-12-26 23:45:59,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:59,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340946487] [2019-12-26 23:45:59,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:59,581 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-26 23:45:59,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340946487] [2019-12-26 23:45:59,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:59,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:59,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396971607] [2019-12-26 23:45:59,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:59,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:59,583 INFO L87 Difference]: Start difference. First operand 7779 states and 24697 transitions. Second operand 9 states. [2019-12-26 23:46:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:00,452 INFO L93 Difference]: Finished difference Result 19412 states and 60248 transitions. [2019-12-26 23:46:00,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:46:00,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 23:46:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:00,479 INFO L225 Difference]: With dead ends: 19412 [2019-12-26 23:46:00,479 INFO L226 Difference]: Without dead ends: 18200 [2019-12-26 23:46:00,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:46:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18200 states. [2019-12-26 23:46:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18200 to 7798. [2019-12-26 23:46:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-26 23:46:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 24807 transitions. [2019-12-26 23:46:00,793 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 24807 transitions. Word has length 54 [2019-12-26 23:46:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 24807 transitions. [2019-12-26 23:46:00,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 24807 transitions. [2019-12-26 23:46:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:46:00,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:00,803 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-26 23:46:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash -380308885, now seen corresponding path program 6 times [2019-12-26 23:46:00,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592920880] [2019-12-26 23:46:00,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,895 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-26 23:46:00,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592920880] [2019-12-26 23:46:00,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:46:00,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803738123] [2019-12-26 23:46:00,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:00,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:00,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:00,897 INFO L87 Difference]: Start difference. First operand 7798 states and 24807 transitions. Second operand 7 states. [2019-12-26 23:46:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:01,828 INFO L93 Difference]: Finished difference Result 17860 states and 54479 transitions. [2019-12-26 23:46:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:46:01,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-26 23:46:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:01,861 INFO L225 Difference]: With dead ends: 17860 [2019-12-26 23:46:01,861 INFO L226 Difference]: Without dead ends: 17776 [2019-12-26 23:46:01,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:46:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17776 states. [2019-12-26 23:46:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17776 to 11755. [2019-12-26 23:46:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11755 states. [2019-12-26 23:46:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11755 states to 11755 states and 35944 transitions. [2019-12-26 23:46:02,170 INFO L78 Accepts]: Start accepts. Automaton has 11755 states and 35944 transitions. Word has length 54 [2019-12-26 23:46:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:02,170 INFO L462 AbstractCegarLoop]: Abstraction has 11755 states and 35944 transitions. [2019-12-26 23:46:02,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 11755 states and 35944 transitions. [2019-12-26 23:46:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:46:02,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:02,183 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-26 23:46:02,183 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-26 23:46:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1744394997, now seen corresponding path program 7 times [2019-12-26 23:46:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974606487] [2019-12-26 23:46:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,264 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-26 23:46:02,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974606487] [2019-12-26 23:46:02,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:02,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168131218] [2019-12-26 23:46:02,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:02,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:02,267 INFO L87 Difference]: Start difference. First operand 11755 states and 35944 transitions. Second operand 6 states. [2019-12-26 23:46:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,847 INFO L93 Difference]: Finished difference Result 17964 states and 53610 transitions. [2019-12-26 23:46:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:46:02,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-26 23:46:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,872 INFO L225 Difference]: With dead ends: 17964 [2019-12-26 23:46:02,873 INFO L226 Difference]: Without dead ends: 17854 [2019-12-26 23:46:02,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:46:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17854 states. [2019-12-26 23:46:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17854 to 15031. [2019-12-26 23:46:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-26 23:46:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 45630 transitions. [2019-12-26 23:46:03,113 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 45630 transitions. Word has length 54 [2019-12-26 23:46:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,113 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 45630 transitions. [2019-12-26 23:46:03,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 45630 transitions. [2019-12-26 23:46:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:46:03,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,129 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-26 23:46:03,129 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -202798091, now seen corresponding path program 8 times [2019-12-26 23:46:03,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9121566] [2019-12-26 23:46:03,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:03,201 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-26 23:46:03,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9121566] [2019-12-26 23:46:03,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:03,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:03,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873113999] [2019-12-26 23:46:03,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:03,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:03,203 INFO L87 Difference]: Start difference. First operand 15031 states and 45630 transitions. Second operand 3 states. [2019-12-26 23:46:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:03,259 INFO L93 Difference]: Finished difference Result 15029 states and 45625 transitions. [2019-12-26 23:46:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:03,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-26 23:46:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:03,281 INFO L225 Difference]: With dead ends: 15029 [2019-12-26 23:46:03,281 INFO L226 Difference]: Without dead ends: 15029 [2019-12-26 23:46:03,281 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-26 23:46:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15029 states. [2019-12-26 23:46:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15029 to 13184. [2019-12-26 23:46:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13184 states. [2019-12-26 23:46:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13184 states to 13184 states and 40519 transitions. [2019-12-26 23:46:03,494 INFO L78 Accepts]: Start accepts. Automaton has 13184 states and 40519 transitions. Word has length 54 [2019-12-26 23:46:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,494 INFO L462 AbstractCegarLoop]: Abstraction has 13184 states and 40519 transitions. [2019-12-26 23:46:03,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13184 states and 40519 transitions. [2019-12-26 23:46:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:03,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,509 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-26 23:46:03,509 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 1 times [2019-12-26 23:46:03,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55659198] [2019-12-26 23:46:03,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:03,571 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-26 23:46:03,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55659198] [2019-12-26 23:46:03,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:03,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:03,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599465191] [2019-12-26 23:46:03,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:03,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:03,573 INFO L87 Difference]: Start difference. First operand 13184 states and 40519 transitions. Second operand 3 states. [2019-12-26 23:46:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:03,614 INFO L93 Difference]: Finished difference Result 8648 states and 26253 transitions. [2019-12-26 23:46:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:03,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:46:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:03,630 INFO L225 Difference]: With dead ends: 8648 [2019-12-26 23:46:03,630 INFO L226 Difference]: Without dead ends: 8648 [2019-12-26 23:46:03,631 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-26 23:46:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2019-12-26 23:46:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 8482. [2019-12-26 23:46:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2019-12-26 23:46:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 25789 transitions. [2019-12-26 23:46:03,944 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 25789 transitions. Word has length 55 [2019-12-26 23:46:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,944 INFO L462 AbstractCegarLoop]: Abstraction has 8482 states and 25789 transitions. [2019-12-26 23:46:03,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 25789 transitions. [2019-12-26 23:46:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:03,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,956 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-26 23:46:03,956 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-26 23:46:03,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268098064] [2019-12-26 23:46:03,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:04,153 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-26 23:46:04,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268098064] [2019-12-26 23:46:04,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:04,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:46:04,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838183424] [2019-12-26 23:46:04,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:46:04,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:46:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:46:04,156 INFO L87 Difference]: Start difference. First operand 8482 states and 25789 transitions. Second operand 11 states. [2019-12-26 23:46:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:04,922 INFO L93 Difference]: Finished difference Result 13435 states and 40255 transitions. [2019-12-26 23:46:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:46:04,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:46:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:04,936 INFO L225 Difference]: With dead ends: 13435 [2019-12-26 23:46:04,936 INFO L226 Difference]: Without dead ends: 9328 [2019-12-26 23:46:04,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-26 23:46:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9328 states. [2019-12-26 23:46:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9328 to 8530. [2019-12-26 23:46:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8530 states. [2019-12-26 23:46:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8530 states to 8530 states and 25515 transitions. [2019-12-26 23:46:05,061 INFO L78 Accepts]: Start accepts. Automaton has 8530 states and 25515 transitions. Word has length 56 [2019-12-26 23:46:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:05,061 INFO L462 AbstractCegarLoop]: Abstraction has 8530 states and 25515 transitions. [2019-12-26 23:46:05,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:46:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8530 states and 25515 transitions. [2019-12-26 23:46:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:05,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:05,069 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-26 23:46:05,069 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:05,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-26 23:46:05,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:05,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291824362] [2019-12-26 23:46:05,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:05,274 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-26 23:46:05,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291824362] [2019-12-26 23:46:05,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:05,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:46:05,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402981292] [2019-12-26 23:46:05,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:46:05,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:46:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:46:05,277 INFO L87 Difference]: Start difference. First operand 8530 states and 25515 transitions. Second operand 12 states. [2019-12-26 23:46:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:05,923 INFO L93 Difference]: Finished difference Result 9730 states and 28516 transitions. [2019-12-26 23:46:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:46:05,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:46:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:05,945 INFO L225 Difference]: With dead ends: 9730 [2019-12-26 23:46:05,945 INFO L226 Difference]: Without dead ends: 9132 [2019-12-26 23:46:05,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:46:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2019-12-26 23:46:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 8212. [2019-12-26 23:46:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2019-12-26 23:46:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 24651 transitions. [2019-12-26 23:46:06,209 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 24651 transitions. Word has length 56 [2019-12-26 23:46:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:06,209 INFO L462 AbstractCegarLoop]: Abstraction has 8212 states and 24651 transitions. [2019-12-26 23:46:06,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:46:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 24651 transitions. [2019-12-26 23:46:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:06,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:06,226 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-26 23:46:06,226 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-26 23:46:06,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:06,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847888560] [2019-12-26 23:46:06,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:06,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:46:06,347 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:46:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= 0 v_~x~0_240) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2076~0.base_30|) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= |v_ULTIMATE.start_main_~#t2076~0.offset_22| 0) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_30|) 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_30|) |v_ULTIMATE.start_main_~#t2076~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2076~0.base_30| 4)) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_14|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2076~0.base=|v_ULTIMATE.start_main_~#t2076~0.base_30|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_22|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2076~0.offset=|v_ULTIMATE.start_main_~#t2076~0.offset_22|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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, ~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_~#t2078~0.base, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2078~0.offset, ~y~0, ULTIMATE.start_main_~#t2076~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2077~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2077~0.offset, ~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_~#t2076~0.offset, 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, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:46:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2077~0.offset_9| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10|) |v_ULTIMATE.start_main_~#t2077~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2077~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2077~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2077~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2077~0.offset] because there is no mapped edge [2019-12-26 23:46:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:46:06,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2078~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2078~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2078~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11|) |v_ULTIMATE.start_main_~#t2078~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2078~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2078~0.base] because there is no mapped edge [2019-12-26 23:46:06,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-815496425 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-815496425 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-815496425| ~x$w_buff1~0_In-815496425) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-815496425| ~x~0_In-815496425) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-815496425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-815496425, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-815496425, ~x~0=~x~0_In-815496425} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-815496425|, ~x$w_buff1~0=~x$w_buff1~0_In-815496425, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-815496425, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-815496425, ~x~0=~x~0_In-815496425} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:46:06,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:46:06,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In498600799 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In498600799 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out498600799| ~x$w_buff0_used~0_In498600799) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out498600799| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In498600799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498600799} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out498600799|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In498600799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498600799} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:46:06,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2134266841 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2134266841 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2134266841| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2134266841| ~x$w_buff0_used~0_In-2134266841) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134266841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134266841} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2134266841, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2134266841|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2134266841} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:46:06,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In910178386 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In910178386 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In910178386 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In910178386 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out910178386| ~x$w_buff1_used~0_In910178386)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out910178386| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In910178386, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In910178386, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In910178386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In910178386} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In910178386, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In910178386, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In910178386, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out910178386|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In910178386} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:46:06,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In671677992 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In671677992 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In671677992 ~x$r_buff0_thd2~0_Out671677992) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out671677992 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In671677992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In671677992} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out671677992|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out671677992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In671677992} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:46:06,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1469783288 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1469783288 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1469783288 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1469783288 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1469783288| ~x$r_buff1_thd2~0_In1469783288)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1469783288| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1469783288, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1469783288, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1469783288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469783288} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1469783288|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1469783288, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1469783288, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1469783288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1469783288} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:46:06,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, 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-26 23:46:06,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1098963274 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1098963274 |P0Thread1of1ForFork2_#t~ite8_Out-1098963274|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1098963274 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1098963274 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1098963274 256))) (= 0 (mod ~x$w_buff0_used~0_In-1098963274 256)))) (= |P0Thread1of1ForFork2_#t~ite9_Out-1098963274| |P0Thread1of1ForFork2_#t~ite8_Out-1098963274|)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-1098963274| |P0Thread1of1ForFork2_#t~ite8_Out-1098963274|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1098963274| ~x$w_buff0~0_In-1098963274) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1098963274, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1098963274, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1098963274|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1098963274, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1098963274, ~weak$$choice2~0=~weak$$choice2~0_In-1098963274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1098963274} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1098963274, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1098963274, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1098963274|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1098963274, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1098963274|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1098963274, ~weak$$choice2~0=~weak$$choice2~0_In-1098963274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1098963274} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:46:06,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-361006874 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-361006874 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-361006874 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-361006874 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-361006874 |P2Thread1of1ForFork1_#t~ite35_Out-361006874|)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-361006874| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-361006874, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-361006874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-361006874|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-361006874, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-361006874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:46:06,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In316912640 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In316912640 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out316912640|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In316912640 |P2Thread1of1ForFork1_#t~ite36_Out316912640|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In316912640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In316912640} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out316912640|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In316912640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In316912640} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:46:06,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-862176165 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-862176165 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-862176165 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-862176165 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-862176165| 0)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-862176165| ~x$r_buff1_thd3~0_In-862176165) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-862176165, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-862176165, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-862176165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862176165} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-862176165|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862176165, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-862176165, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-862176165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862176165} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:46:06,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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-26 23:46:06,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1847232697 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1847232697 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1847232697 256) 0)) (= (mod ~x$w_buff0_used~0_In-1847232697 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1847232697 256))))) (= |P0Thread1of1ForFork2_#t~ite18_Out-1847232697| |P0Thread1of1ForFork2_#t~ite17_Out-1847232697|) (= ~x$w_buff1_used~0_In-1847232697 |P0Thread1of1ForFork2_#t~ite17_Out-1847232697|) .cse1) (and (= ~x$w_buff1_used~0_In-1847232697 |P0Thread1of1ForFork2_#t~ite18_Out-1847232697|) (= |P0Thread1of1ForFork2_#t~ite17_In-1847232697| |P0Thread1of1ForFork2_#t~ite17_Out-1847232697|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1847232697, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1847232697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1847232697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1847232697, ~weak$$choice2~0=~weak$$choice2~0_In-1847232697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1847232697} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1847232697, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1847232697|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1847232697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1847232697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1847232697, ~weak$$choice2~0=~weak$$choice2~0_In-1847232697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1847232697} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:46:06,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:46:06,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-890872761 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-890872761| ~x$r_buff1_thd1~0_In-890872761) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-890872761| |P0Thread1of1ForFork2_#t~ite23_Out-890872761|)) (and (= ~x$r_buff1_thd1~0_In-890872761 |P0Thread1of1ForFork2_#t~ite23_Out-890872761|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-890872761 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-890872761 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In-890872761 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-890872761 256) 0))) (= |P0Thread1of1ForFork2_#t~ite24_Out-890872761| |P0Thread1of1ForFork2_#t~ite23_Out-890872761|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-890872761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890872761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-890872761, ~weak$$choice2~0=~weak$$choice2~0_In-890872761, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-890872761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890872761} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-890872761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890872761, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-890872761, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-890872761|, ~weak$$choice2~0=~weak$$choice2~0_In-890872761, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-890872761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890872761} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:46:06,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:46:06,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:46:06,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1832020696 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1832020696 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1832020696| ~x~0_In1832020696) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1832020696 |ULTIMATE.start_main_#t~ite41_Out1832020696|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1832020696, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832020696, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1832020696, ~x~0=~x~0_In1832020696} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1832020696|, ~x$w_buff1~0=~x$w_buff1~0_In1832020696, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832020696, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1832020696, ~x~0=~x~0_In1832020696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:46:06,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:46:06,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1903575405 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1903575405 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1903575405| ~x$w_buff0_used~0_In1903575405) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1903575405| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1903575405, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903575405} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1903575405, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1903575405|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903575405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:46:06,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1577934717 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1577934717 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1577934717 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1577934717 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1577934717| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1577934717| ~x$w_buff1_used~0_In-1577934717)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577934717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577934717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1577934717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577934717} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577934717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577934717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1577934717, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1577934717|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577934717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:46:06,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In776452286 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In776452286 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out776452286| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In776452286 |ULTIMATE.start_main_#t~ite45_Out776452286|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In776452286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In776452286} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In776452286, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out776452286|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In776452286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:46:06,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-524240144 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-524240144 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-524240144 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-524240144 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-524240144|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-524240144 |ULTIMATE.start_main_#t~ite46_Out-524240144|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524240144, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-524240144, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-524240144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524240144} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524240144, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-524240144|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-524240144, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-524240144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524240144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:46:06,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, 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-26 23:46:06,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:46:06 BasicIcfg [2019-12-26 23:46:06,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:46:06,511 INFO L168 Benchmark]: Toolchain (without parser) took 163799.85 ms. Allocated memory was 143.1 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,515 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.96 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 154.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.08 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,517 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,522 INFO L168 Benchmark]: RCFGBuilder took 813.06 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 103.1 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,523 INFO L168 Benchmark]: TraceAbstraction took 162084.50 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 959.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:06,528 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.47 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.96 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 98.7 MB in the beginning and 154.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.08 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.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 38.59 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.06 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 103.1 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162084.50 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 959.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2076, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L820] FCALL, FORK 0 pthread_create(&t2077, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L775] 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_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, z=0] [L822] FCALL, FORK 0 pthread_create(&t2078, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=1] [L795] 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_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=1, z=1] [L775] 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 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=2] [L739] 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=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=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L739] 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) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 : (!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))=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=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=1, z=2] [L741] 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)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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_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))=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=1, z=2] [L742] 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)) [L743] 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)) [L745] 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)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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: 161.7s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 56.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4313 SDtfs, 6793 SDslu, 11550 SDs, 0 SdLazy, 5146 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 40 SyntacticMatches, 13 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 84.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 175880 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 162533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...