/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/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:12:43,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:12:43,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:12:43,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:12:43,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:12:43,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:12:43,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:12:43,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:12:43,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:12:43,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:12:43,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:12:43,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:12:43,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:12:43,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:12:43,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:12:43,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:12:43,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:12:43,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:12:43,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:12:43,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:12:43,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:12:43,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:12:43,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:12:43,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:12:43,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:12:43,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:12:43,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:12:43,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:12:43,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:12:43,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:12:43,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:12:43,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:12:43,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:12:43,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:12:43,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:12:43,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:12:43,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:12:43,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:12:43,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:12:43,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:12:43,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:12:43,376 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-27 00:12:43,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:12:43,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:12:43,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:12:43,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:12:43,392 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:12:43,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:12:43,393 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:12:43,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:12:43,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:12:43,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:12:43,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:12:43,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:12:43,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:12:43,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:12:43,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:12:43,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:12:43,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:12:43,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:12:43,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:12:43,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:12:43,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:12:43,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:12:43,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:12:43,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:12:43,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:12:43,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:12:43,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:12:43,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:12:43,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:12:43,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:12:43,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:12:43,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:12:43,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:12:43,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:12:43,700 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:12:43,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-27 00:12:43,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a5a0ba5/ef60863daf7f489eae00850f98d03112/FLAGec9ae4365 [2019-12-27 00:12:44,368 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:12:44,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-27 00:12:44,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a5a0ba5/ef60863daf7f489eae00850f98d03112/FLAGec9ae4365 [2019-12-27 00:12:44,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a5a0ba5/ef60863daf7f489eae00850f98d03112 [2019-12-27 00:12:44,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:12:44,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:12:44,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:44,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:12:44,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:12:44,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:44" (1/1) ... [2019-12-27 00:12:44,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dfbf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:44, skipping insertion in model container [2019-12-27 00:12:44,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:44" (1/1) ... [2019-12-27 00:12:44,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:12:44,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:12:45,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:45,308 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:12:45,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:45,458 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:12:45,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45 WrapperNode [2019-12-27 00:12:45,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:45,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:45,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:12:45,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:12:45,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:45,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:12:45,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:12:45,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:12:45,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... [2019-12-27 00:12:45,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:12:45,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:12:45,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:12:45,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:12:45,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:12:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:12:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:12:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:12:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:12:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:12:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:12:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:12:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:12:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:12:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:12:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:12:45,656 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:12:46,413 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:12:46,413 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:12:46,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:46 BoogieIcfgContainer [2019-12-27 00:12:46,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:12:46,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:12:46,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:12:46,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:12:46,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:12:44" (1/3) ... [2019-12-27 00:12:46,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a1e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:46, skipping insertion in model container [2019-12-27 00:12:46,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:45" (2/3) ... [2019-12-27 00:12:46,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a1e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:46, skipping insertion in model container [2019-12-27 00:12:46,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:46" (3/3) ... [2019-12-27 00:12:46,424 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-12-27 00:12:46,435 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:12:46,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:12:46,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:12:46,445 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:12:46,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,505 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:46,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:12:46,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:12:46,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:12:46,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:12:46,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:12:46,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:12:46,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:12:46,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:12:46,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:12:46,565 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 00:12:46,567 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:46,697 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:46,697 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:46,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:46,727 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:46,811 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:46,812 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:46,820 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:46,837 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 00:12:46,838 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:12:51,609 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 00:12:51,736 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 00:12:51,736 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 00:12:51,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 00:12:52,218 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 00:12:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 00:12:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:12:52,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:52,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:12:52,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 00:12:52,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:52,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004201854] [2019-12-27 00:12:52,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:52,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004201854] [2019-12-27 00:12:52,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:52,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:12:52,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056199316] [2019-12-27 00:12:52,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:52,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:52,484 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 00:12:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:52,859 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 00:12:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:52,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:12:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:52,972 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 00:12:52,972 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 00:12:52,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 00:12:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 00:12:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 00:12:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 00:12:53,379 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 00:12:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:53,379 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 00:12:53,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 00:12:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:12:53,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:53,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:53,383 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 00:12:53,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:53,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100014251] [2019-12-27 00:12:53,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:53,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100014251] [2019-12-27 00:12:53,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:53,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:12:53,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487193004] [2019-12-27 00:12:53,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:12:53,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:12:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:12:53,501 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 00:12:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:54,003 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 00:12:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:12:54,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:12:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:54,096 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 00:12:54,096 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 00:12:54,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 00:12:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 00:12:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 00:12:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 00:12:55,212 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 00:12:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:55,212 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 00:12:55,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:12:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 00:12:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:12:55,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:55,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:55,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 00:12:55,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:55,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125330631] [2019-12-27 00:12:55,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125330631] [2019-12-27 00:12:55,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:55,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:12:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967955851] [2019-12-27 00:12:55,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:12:55,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:12:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:12:55,344 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 00:12:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:55,591 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-27 00:12:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:12:55,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:12:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:55,641 INFO L225 Difference]: With dead ends: 14268 [2019-12-27 00:12:55,641 INFO L226 Difference]: Without dead ends: 14268 [2019-12-27 00:12:55,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-27 00:12:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-27 00:12:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-27 00:12:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-27 00:12:56,137 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-27 00:12:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:56,138 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-27 00:12:56,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:12:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-27 00:12:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:12:56,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:56,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:56,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-27 00:12:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:56,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380643890] [2019-12-27 00:12:56,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:56,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380643890] [2019-12-27 00:12:56,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:12:56,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209215027] [2019-12-27 00:12:56,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:12:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:12:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:12:56,307 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-27 00:12:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:56,814 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-27 00:12:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:12:56,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:12:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:56,870 INFO L225 Difference]: With dead ends: 17010 [2019-12-27 00:12:56,871 INFO L226 Difference]: Without dead ends: 17003 [2019-12-27 00:12:56,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:12:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-27 00:12:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-27 00:12:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-27 00:12:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-27 00:12:57,415 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-27 00:12:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-27 00:12:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:12:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-27 00:12:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:12:57,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:57,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:57,429 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-27 00:12:57,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:57,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361353303] [2019-12-27 00:12:57,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:57,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361353303] [2019-12-27 00:12:57,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:57,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:12:57,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537102675] [2019-12-27 00:12:57,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:12:57,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:12:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:57,473 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-27 00:12:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:57,604 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-27 00:12:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:12:57,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 00:12:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:57,662 INFO L225 Difference]: With dead ends: 15529 [2019-12-27 00:12:57,662 INFO L226 Difference]: Without dead ends: 15529 [2019-12-27 00:12:57,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:12:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-27 00:12:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-27 00:12:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-27 00:12:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-27 00:12:58,037 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-27 00:12:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:58,038 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-27 00:12:58,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:12:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-27 00:12:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:12:58,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:58,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:58,722 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-27 00:12:58,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:58,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268272908] [2019-12-27 00:12:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:12:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:12:58,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268272908] [2019-12-27 00:12:58,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:12:58,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:12:58,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131493944] [2019-12-27 00:12:58,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:12:58,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:12:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:12:58,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:12:58,854 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-27 00:12:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:12:59,411 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-27 00:12:59,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:12:59,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 00:12:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:12:59,461 INFO L225 Difference]: With dead ends: 19657 [2019-12-27 00:12:59,461 INFO L226 Difference]: Without dead ends: 19641 [2019-12-27 00:12:59,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:12:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-27 00:12:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-27 00:12:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-27 00:12:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-27 00:12:59,934 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-27 00:12:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:12:59,935 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-27 00:12:59,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:12:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-27 00:12:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:12:59,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:12:59,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:12:59,963 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:12:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:12:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-27 00:12:59,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:12:59,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301557940] [2019-12-27 00:12:59,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:12:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:00,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301557940] [2019-12-27 00:13:00,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:00,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:00,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130615114] [2019-12-27 00:13:00,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:00,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:00,038 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 4 states. [2019-12-27 00:13:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:00,070 INFO L93 Difference]: Finished difference Result 2247 states and 5122 transitions. [2019-12-27 00:13:00,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:13:00,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 00:13:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:00,074 INFO L225 Difference]: With dead ends: 2247 [2019-12-27 00:13:00,074 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 00:13:00,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 00:13:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2019-12-27 00:13:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-27 00:13:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-27 00:13:00,108 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-27 00:13:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:00,108 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-27 00:13:00,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-27 00:13:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 00:13:00,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:00,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:00,113 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-27 00:13:00,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:00,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010681796] [2019-12-27 00:13:00,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:00,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010681796] [2019-12-27 00:13:00,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:00,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:13:00,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246281935] [2019-12-27 00:13:00,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:13:00,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:13:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:13:00,513 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 9 states. [2019-12-27 00:13:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:01,140 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-27 00:13:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:13:01,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 00:13:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:01,144 INFO L225 Difference]: With dead ends: 2561 [2019-12-27 00:13:01,144 INFO L226 Difference]: Without dead ends: 2559 [2019-12-27 00:13:01,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-27 00:13:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-27 00:13:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-27 00:13:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-27 00:13:01,176 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-27 00:13:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:01,177 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-27 00:13:01,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:13:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-27 00:13:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:13:01,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:01,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:01,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-27 00:13:01,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:01,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273887669] [2019-12-27 00:13:01,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:01,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273887669] [2019-12-27 00:13:01,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:01,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:01,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909531717] [2019-12-27 00:13:01,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:01,292 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-27 00:13:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:01,812 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-27 00:13:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:01,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 00:13:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:01,818 INFO L225 Difference]: With dead ends: 2780 [2019-12-27 00:13:01,818 INFO L226 Difference]: Without dead ends: 2780 [2019-12-27 00:13:01,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-27 00:13:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-27 00:13:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-27 00:13:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-27 00:13:01,855 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-27 00:13:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:01,855 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-27 00:13:01,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-27 00:13:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:13:01,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:01,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:01,860 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-27 00:13:01,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:01,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788645668] [2019-12-27 00:13:01,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:01,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788645668] [2019-12-27 00:13:01,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:01,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:01,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105909314] [2019-12-27 00:13:01,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:01,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:01,925 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 3 states. [2019-12-27 00:13:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:01,951 INFO L93 Difference]: Finished difference Result 2372 states and 5134 transitions. [2019-12-27 00:13:01,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:01,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 00:13:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:01,954 INFO L225 Difference]: With dead ends: 2372 [2019-12-27 00:13:01,955 INFO L226 Difference]: Without dead ends: 2372 [2019-12-27 00:13:01,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-12-27 00:13:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2019-12-27 00:13:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-27 00:13:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 5118 transitions. [2019-12-27 00:13:01,987 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 5118 transitions. Word has length 42 [2019-12-27 00:13:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:01,987 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 5118 transitions. [2019-12-27 00:13:01,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 5118 transitions. [2019-12-27 00:13:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:13:01,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:01,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:01,993 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-27 00:13:01,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:01,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876293380] [2019-12-27 00:13:01,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:02,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876293380] [2019-12-27 00:13:02,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:02,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:13:02,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967864128] [2019-12-27 00:13:02,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:02,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:02,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:02,135 INFO L87 Difference]: Start difference. First operand 2364 states and 5118 transitions. Second operand 5 states. [2019-12-27 00:13:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:02,174 INFO L93 Difference]: Finished difference Result 581 states and 1046 transitions. [2019-12-27 00:13:02,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:02,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 00:13:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:02,176 INFO L225 Difference]: With dead ends: 581 [2019-12-27 00:13:02,176 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 00:13:02,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:13:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 00:13:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 425. [2019-12-27 00:13:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-27 00:13:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 753 transitions. [2019-12-27 00:13:02,182 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 753 transitions. Word has length 42 [2019-12-27 00:13:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:02,183 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 753 transitions. [2019-12-27 00:13:02,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 753 transitions. [2019-12-27 00:13:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:13:02,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:02,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:02,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash 923557156, now seen corresponding path program 1 times [2019-12-27 00:13:02,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:02,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253335739] [2019-12-27 00:13:02,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:02,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253335739] [2019-12-27 00:13:02,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:02,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:13:02,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690577186] [2019-12-27 00:13:02,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:13:02,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:13:02,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:13:02,330 INFO L87 Difference]: Start difference. First operand 425 states and 753 transitions. Second operand 7 states. [2019-12-27 00:13:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:02,531 INFO L93 Difference]: Finished difference Result 514 states and 908 transitions. [2019-12-27 00:13:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:02,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:13:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:02,533 INFO L225 Difference]: With dead ends: 514 [2019-12-27 00:13:02,534 INFO L226 Difference]: Without dead ends: 514 [2019-12-27 00:13:02,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:13:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-27 00:13:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 432. [2019-12-27 00:13:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-27 00:13:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 766 transitions. [2019-12-27 00:13:02,540 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 766 transitions. Word has length 53 [2019-12-27 00:13:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:02,541 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 766 transitions. [2019-12-27 00:13:02,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:13:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 766 transitions. [2019-12-27 00:13:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:13:02,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:02,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:02,542 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 2 times [2019-12-27 00:13:02,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:02,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033509851] [2019-12-27 00:13:02,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:02,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033509851] [2019-12-27 00:13:02,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:02,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:02,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577314496] [2019-12-27 00:13:02,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:02,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:02,644 INFO L87 Difference]: Start difference. First operand 432 states and 766 transitions. Second operand 6 states. [2019-12-27 00:13:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:02,708 INFO L93 Difference]: Finished difference Result 719 states and 1277 transitions. [2019-12-27 00:13:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:02,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 00:13:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:02,710 INFO L225 Difference]: With dead ends: 719 [2019-12-27 00:13:02,710 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 00:13:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 00:13:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2019-12-27 00:13:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-27 00:13:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 551 transitions. [2019-12-27 00:13:02,716 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 551 transitions. Word has length 53 [2019-12-27 00:13:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:02,716 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 551 transitions. [2019-12-27 00:13:02,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 551 transitions. [2019-12-27 00:13:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:13:02,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:02,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:02,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2062591520, now seen corresponding path program 3 times [2019-12-27 00:13:02,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:02,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939506184] [2019-12-27 00:13:02,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:02,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939506184] [2019-12-27 00:13:02,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:02,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:02,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582677732] [2019-12-27 00:13:02,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:02,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:02,790 INFO L87 Difference]: Start difference. First operand 308 states and 551 transitions. Second operand 3 states. [2019-12-27 00:13:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:02,827 INFO L93 Difference]: Finished difference Result 307 states and 549 transitions. [2019-12-27 00:13:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:02,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:13:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:02,828 INFO L225 Difference]: With dead ends: 307 [2019-12-27 00:13:02,828 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 00:13:02,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 00:13:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2019-12-27 00:13:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 00:13:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 00:13:02,832 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 53 [2019-12-27 00:13:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:02,832 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 00:13:02,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 00:13:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:02,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:02,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:02,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-27 00:13:02,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:02,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788098843] [2019-12-27 00:13:02,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:03,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788098843] [2019-12-27 00:13:03,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:03,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:13:03,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541141566] [2019-12-27 00:13:03,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:03,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:03,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:03,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:03,047 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 13 states. [2019-12-27 00:13:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:03,567 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-27 00:13:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:13:03,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 00:13:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:03,568 INFO L225 Difference]: With dead ends: 384 [2019-12-27 00:13:03,569 INFO L226 Difference]: Without dead ends: 353 [2019-12-27 00:13:03,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:13:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-27 00:13:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-27 00:13:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 00:13:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 00:13:03,575 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 00:13:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:03,575 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 00:13:03,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 00:13:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:03,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:03,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:03,577 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-12-27 00:13:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:03,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214699157] [2019-12-27 00:13:03,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:03,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214699157] [2019-12-27 00:13:03,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:03,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 00:13:03,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575949909] [2019-12-27 00:13:03,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 00:13:03,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 00:13:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:13:03,987 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 17 states. [2019-12-27 00:13:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:05,341 INFO L93 Difference]: Finished difference Result 636 states and 1062 transitions. [2019-12-27 00:13:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 00:13:05,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 00:13:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:05,344 INFO L225 Difference]: With dead ends: 636 [2019-12-27 00:13:05,344 INFO L226 Difference]: Without dead ends: 588 [2019-12-27 00:13:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 00:13:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-12-27 00:13:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 325. [2019-12-27 00:13:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-27 00:13:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 571 transitions. [2019-12-27 00:13:05,349 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 571 transitions. Word has length 54 [2019-12-27 00:13:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:05,349 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 571 transitions. [2019-12-27 00:13:05,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 00:13:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 571 transitions. [2019-12-27 00:13:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:05,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:05,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:05,350 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash 277931730, now seen corresponding path program 3 times [2019-12-27 00:13:05,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:05,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070327852] [2019-12-27 00:13:05,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:05,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070327852] [2019-12-27 00:13:05,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:05,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:13:05,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494728978] [2019-12-27 00:13:05,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:05,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:05,633 INFO L87 Difference]: Start difference. First operand 325 states and 571 transitions. Second operand 13 states. [2019-12-27 00:13:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:06,207 INFO L93 Difference]: Finished difference Result 426 states and 723 transitions. [2019-12-27 00:13:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:13:06,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 00:13:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:06,209 INFO L225 Difference]: With dead ends: 426 [2019-12-27 00:13:06,209 INFO L226 Difference]: Without dead ends: 395 [2019-12-27 00:13:06,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 00:13:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-27 00:13:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 327. [2019-12-27 00:13:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 00:13:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-27 00:13:06,216 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-27 00:13:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:06,216 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-27 00:13:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-27 00:13:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:06,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:06,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:06,218 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 4 times [2019-12-27 00:13:06,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:06,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438816596] [2019-12-27 00:13:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:06,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:13:06,336 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:13:06,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19|) 0) (= v_~y$r_buff1_thd0~0_304 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2477~0.base_19|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19| 1) |v_#valid_38|) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd1~0_220 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19|) |v_ULTIMATE.start_main_~#t2477~0.offset_16| 0)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| 4)) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= 0 |v_ULTIMATE.start_main_~#t2477~0.offset_16|) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_~#t2477~0.base=|v_ULTIMATE.start_main_~#t2477~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_~#t2477~0.offset=|v_ULTIMATE.start_main_~#t2477~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_~#t2477~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t2478~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2478~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2477~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:06,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11|) |v_ULTIMATE.start_main_~#t2478~0.offset_10| 1))) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2478~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2478~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_10|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2478~0.offset, ULTIMATE.start_main_~#t2478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 00:13:06,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:06,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1903744207 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1903744207 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1903744207| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1903744207| ~y$w_buff0_used~0_In1903744207)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1903744207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1903744207} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1903744207|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1903744207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1903744207} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 00:13:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1087865659 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1087865659 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1087865659| ~y$w_buff1~0_In1087865659) (not .cse0) (not .cse1)) (and (= ~y~0_In1087865659 |P1Thread1of1ForFork1_#t~ite9_Out1087865659|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1087865659, ~y$w_buff1~0=~y$w_buff1~0_In1087865659, ~y~0=~y~0_In1087865659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1087865659} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1087865659, ~y$w_buff1~0=~y$w_buff1~0_In1087865659, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1087865659|, ~y~0=~y~0_In1087865659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1087865659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 00:13:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 00:13:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-911313752 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-911313752 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-911313752 |P1Thread1of1ForFork1_#t~ite11_Out-911313752|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-911313752|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-911313752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-911313752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-911313752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-911313752, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-911313752|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 00:13:06,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In28975607 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In28975607 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In28975607 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In28975607 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out28975607| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out28975607| ~y$w_buff1_used~0_In28975607) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In28975607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In28975607, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In28975607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In28975607} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out28975607|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In28975607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In28975607, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In28975607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In28975607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 00:13:06,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2047328957 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2047328957 256)))) (or (and (= ~y$r_buff0_thd1~0_In-2047328957 ~y$r_buff0_thd1~0_Out-2047328957) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-2047328957) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2047328957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2047328957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2047328957, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2047328957|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2047328957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 00:13:06,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In280903600 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In280903600 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In280903600 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In280903600 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out280903600|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In280903600 |P1Thread1of1ForFork1_#t~ite12_Out280903600|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In280903600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In280903600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In280903600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In280903600} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In280903600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In280903600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In280903600, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out280903600|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In280903600} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 00:13:06,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In727695262 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In727695262 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out727695262|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out727695262| ~y$r_buff0_thd2~0_In727695262) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In727695262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In727695262} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In727695262, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In727695262, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out727695262|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 00:13:06,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1956089634 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1956089634 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1956089634 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1956089634 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1956089634| ~y$r_buff1_thd2~0_In-1956089634) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1956089634| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1956089634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956089634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1956089634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956089634} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1956089634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956089634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1956089634, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1956089634|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956089634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 00:13:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 00:13:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1727692568 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1727692568 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1727692568 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1727692568 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1727692568|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1727692568 |P0Thread1of1ForFork0_#t~ite8_Out1727692568|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1727692568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1727692568, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1727692568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1727692568} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1727692568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1727692568, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1727692568|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1727692568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1727692568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 00:13:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 00:13:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 00:13:06,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1733043920 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1733043920 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-1733043920| ~y~0_In-1733043920) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1733043920| ~y$w_buff1~0_In-1733043920) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1733043920, ~y~0=~y~0_In-1733043920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1733043920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1733043920} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1733043920|, ~y$w_buff1~0=~y$w_buff1~0_In-1733043920, ~y~0=~y~0_In-1733043920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1733043920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1733043920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 00:13:06,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 00:13:06,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1371308673 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1371308673 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1371308673| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1371308673 |ULTIMATE.start_main_#t~ite19_Out1371308673|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1371308673, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371308673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1371308673, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1371308673|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371308673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:13:06,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1058026954 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1058026954 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1058026954 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1058026954 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1058026954| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out1058026954| ~y$w_buff1_used~0_In1058026954)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1058026954, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1058026954, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1058026954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1058026954} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1058026954, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1058026954, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1058026954|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1058026954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1058026954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:13:06,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1388102261 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1388102261 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1388102261| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1388102261| ~y$r_buff0_thd0~0_In-1388102261)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388102261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388102261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388102261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388102261, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1388102261|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:13:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1196627928 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1196627928 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1196627928 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1196627928 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1196627928| ~y$r_buff1_thd0~0_In1196627928) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1196627928|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1196627928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1196627928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1196627928, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196627928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1196627928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1196627928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1196627928, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1196627928|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1196627928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:13:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In814078888 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_In814078888| |ULTIMATE.start_main_#t~ite34_Out814078888|) (= ~y$w_buff0_used~0_In814078888 |ULTIMATE.start_main_#t~ite35_Out814078888|)) (and (= ~y$w_buff0_used~0_In814078888 |ULTIMATE.start_main_#t~ite34_Out814078888|) .cse0 (= |ULTIMATE.start_main_#t~ite35_Out814078888| |ULTIMATE.start_main_#t~ite34_Out814078888|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In814078888 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In814078888 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In814078888 256))) (= (mod ~y$w_buff0_used~0_In814078888 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In814078888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In814078888, ~weak$$choice2~0=~weak$$choice2~0_In814078888, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In814078888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814078888, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In814078888|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In814078888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In814078888, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out814078888|, ~weak$$choice2~0=~weak$$choice2~0_In814078888, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In814078888, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out814078888|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814078888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 00:13:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 00:13:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:13:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:13:06,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:13:06 BasicIcfg [2019-12-27 00:13:06,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:13:06,422 INFO L168 Benchmark]: Toolchain (without parser) took 21778.92 ms. Allocated memory was 136.8 MB in the beginning and 879.2 MB in the end (delta: 742.4 MB). Free memory was 99.2 MB in the beginning and 742.3 MB in the end (delta: -643.0 MB). Peak memory consumption was 583.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,423 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.60 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 155.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.84 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,425 INFO L168 Benchmark]: Boogie Preprocessor took 48.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,426 INFO L168 Benchmark]: RCFGBuilder took 829.19 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 106.0 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,426 INFO L168 Benchmark]: TraceAbstraction took 20004.33 ms. Allocated memory was 200.8 MB in the beginning and 879.2 MB in the end (delta: 678.4 MB). Free memory was 105.3 MB in the beginning and 742.3 MB in the end (delta: -637.0 MB). Peak memory consumption was 525.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:06,430 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.60 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 155.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.84 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.19 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 106.0 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20004.33 ms. Allocated memory was 200.8 MB in the beginning and 879.2 MB in the end (delta: 678.4 MB). Free memory was 105.3 MB in the beginning and 742.3 MB in the end (delta: -637.0 MB). Peak memory consumption was 525.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2051 SDtfs, 2124 SDslu, 5307 SDs, 0 SdLazy, 3759 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred 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: 3.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 14114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 129411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...