/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/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:41:44,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:41:44,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:41:44,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:41:44,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:41:44,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:41:44,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:41:44,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:41:44,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:41:44,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:41:44,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:41:44,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:41:44,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:41:44,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:41:44,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:41:44,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:41:44,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:41:44,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:41:44,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:41:44,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:41:44,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:41:44,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:41:44,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:41:44,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:41:44,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:41:44,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:41:44,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:41:44,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:41:44,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:41:44,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:41:44,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:41:44,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:41:44,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:41:44,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:41:44,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:41:44,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:41:44,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:41:44,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:41:44,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:41:44,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:41:44,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:41:44,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:41:44,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:41:44,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:41:44,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:41:44,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:41:44,488 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:41:44,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:41:44,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:41:44,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:41:44,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:41:44,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:41:44,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:41:44,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:41:44,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:41:44,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:41:44,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:41:44,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:41:44,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:41:44,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:41:44,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:41:44,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:41:44,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:41:44,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:41:44,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:41:44,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:41:44,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:41:44,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:41:44,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:41:44,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:41:44,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:41:44,806 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:41:44,807 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-26 22:41:44,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340e51279/28deacbc2c53493ba85c5b414bdf282e/FLAG709cc3b3d [2019-12-26 22:41:45,482 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:41:45,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-26 22:41:45,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340e51279/28deacbc2c53493ba85c5b414bdf282e/FLAG709cc3b3d [2019-12-26 22:41:45,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340e51279/28deacbc2c53493ba85c5b414bdf282e [2019-12-26 22:41:45,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:41:45,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:41:45,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:41:45,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:41:45,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:41:45,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:41:45" (1/1) ... [2019-12-26 22:41:45,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb8c5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:45, skipping insertion in model container [2019-12-26 22:41:45,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:41:45" (1/1) ... [2019-12-26 22:41:45,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:41:45,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:41:46,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:41:46,349 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:41:46,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:41:46,499 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:41:46,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46 WrapperNode [2019-12-26 22:41:46,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:41:46,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:41:46,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:41:46,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:41:46,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:41:46,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:41:46,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:41:46,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:41:46,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... [2019-12-26 22:41:46,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:41:46,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:41:46,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:41:46,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:41:46,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:41:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:41:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:41:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:41:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:41:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:41:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:41:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:41:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:41:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:41:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:41:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:41:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:41:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:41:46,684 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:41:47,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:41:47,378 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:41:47,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:41:47 BoogieIcfgContainer [2019-12-26 22:41:47,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:41:47,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:41:47,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:41:47,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:41:47,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:41:45" (1/3) ... [2019-12-26 22:41:47,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37efc2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:41:47, skipping insertion in model container [2019-12-26 22:41:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:41:46" (2/3) ... [2019-12-26 22:41:47,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37efc2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:41:47, skipping insertion in model container [2019-12-26 22:41:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:41:47" (3/3) ... [2019-12-26 22:41:47,388 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2019-12-26 22:41:47,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:41:47,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:41:47,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:41:47,408 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:41:47,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,475 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,478 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,479 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:41:47,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:41:47,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:41:47,533 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:41:47,533 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:41:47,533 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:41:47,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:41:47,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:41:47,534 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:41:47,534 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:41:47,551 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-26 22:41:47,553 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 22:41:47,643 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 22:41:47,643 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:41:47,656 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:41:47,676 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 22:41:47,724 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 22:41:47,724 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:41:47,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:41:47,744 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-26 22:41:47,745 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:41:52,678 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:41:52,814 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:41:52,829 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-26 22:41:52,830 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 22:41:52,833 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-26 22:41:53,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-26 22:41:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-26 22:41:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:41:53,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:53,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:53,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-26 22:41:53,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:53,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483791640] [2019-12-26 22:41:53,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:54,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483791640] [2019-12-26 22:41:54,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:54,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:41:54,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493451243] [2019-12-26 22:41:54,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:41:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:41:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:54,066 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-26 22:41:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:54,466 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-26 22:41:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:41:54,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:41:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:54,717 INFO L225 Difference]: With dead ends: 16034 [2019-12-26 22:41:54,717 INFO L226 Difference]: Without dead ends: 15698 [2019-12-26 22:41:54,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-26 22:41:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-26 22:41:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-26 22:41:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-26 22:41:56,051 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-26 22:41:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:56,052 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-26 22:41:56,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:41:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-26 22:41:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:41:56,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:56,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:56,058 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-26 22:41:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390717100] [2019-12-26 22:41:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:56,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390717100] [2019-12-26 22:41:56,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:56,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:41:56,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331958540] [2019-12-26 22:41:56,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:41:56,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:41:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:41:56,187 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-26 22:41:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:57,054 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-26 22:41:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:41:57,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:41:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:57,155 INFO L225 Difference]: With dead ends: 24414 [2019-12-26 22:41:57,155 INFO L226 Difference]: Without dead ends: 24400 [2019-12-26 22:41:57,156 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-26 22:41:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-26 22:41:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-26 22:41:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-26 22:41:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-26 22:41:58,141 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-26 22:41:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:58,141 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-26 22:41:58,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:41:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-26 22:41:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:41:58,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:58,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:58,148 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-26 22:41:58,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:58,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175586204] [2019-12-26 22:41:58,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:58,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175586204] [2019-12-26 22:41:58,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:58,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:41:58,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771035986] [2019-12-26 22:41:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:41:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:41:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:58,240 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-26 22:41:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:58,313 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-26 22:41:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:41:58,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:41:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:58,356 INFO L225 Difference]: With dead ends: 12731 [2019-12-26 22:41:58,356 INFO L226 Difference]: Without dead ends: 12731 [2019-12-26 22:41:58,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-26 22:41:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-26 22:41:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-26 22:41:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-26 22:41:59,613 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-26 22:41:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:59,614 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-26 22:41:59,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:41:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-26 22:41:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:41:59,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:59,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:59,616 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-26 22:41:59,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:59,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951431679] [2019-12-26 22:41:59,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:59,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951431679] [2019-12-26 22:41:59,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:59,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:41:59,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534308972] [2019-12-26 22:41:59,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:41:59,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:59,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:41:59,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:41:59,659 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-26 22:41:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:59,681 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-26 22:41:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:41:59,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:41:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:59,686 INFO L225 Difference]: With dead ends: 1935 [2019-12-26 22:41:59,686 INFO L226 Difference]: Without dead ends: 1935 [2019-12-26 22:41:59,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:41:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-26 22:41:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-26 22:41:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-26 22:41:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-26 22:41:59,719 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-26 22:41:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:59,720 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-26 22:41:59,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:41:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-26 22:41:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:41:59,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:59,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:59,722 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-26 22:41:59,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:59,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016529801] [2019-12-26 22:41:59,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:59,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016529801] [2019-12-26 22:41:59,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:59,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:41:59,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146961428] [2019-12-26 22:41:59,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:41:59,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:41:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:41:59,781 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-26 22:41:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:59,812 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-26 22:41:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:41:59,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:41:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:59,814 INFO L225 Difference]: With dead ends: 652 [2019-12-26 22:41:59,814 INFO L226 Difference]: Without dead ends: 652 [2019-12-26 22:41:59,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:41:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-26 22:41:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-26 22:41:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-26 22:41:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-26 22:41:59,826 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-26 22:41:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:59,826 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-26 22:41:59,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:41:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-26 22:41:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:41:59,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:59,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:59,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-26 22:41:59,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:59,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064901853] [2019-12-26 22:41:59,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:41:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:41:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:41:59,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064901853] [2019-12-26 22:41:59,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:41:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:41:59,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893996307] [2019-12-26 22:41:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:41:59,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:41:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:41:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:59,917 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-26 22:41:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:41:59,962 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-26 22:41:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:41:59,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:41:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:41:59,964 INFO L225 Difference]: With dead ends: 608 [2019-12-26 22:41:59,965 INFO L226 Difference]: Without dead ends: 608 [2019-12-26 22:41:59,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:41:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-26 22:41:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-26 22:41:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-26 22:41:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-26 22:41:59,975 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-26 22:41:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:41:59,976 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-26 22:41:59,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:41:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-26 22:41:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:41:59,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:41:59,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:41:59,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:41:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:41:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-26 22:41:59,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:41:59,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438413637] [2019-12-26 22:41:59,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:00,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438413637] [2019-12-26 22:42:00,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:00,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:42:00,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586233030] [2019-12-26 22:42:00,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:42:00,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:42:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:00,069 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-26 22:42:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:00,118 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-26 22:42:00,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:42:00,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:42:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:00,120 INFO L225 Difference]: With dead ends: 608 [2019-12-26 22:42:00,120 INFO L226 Difference]: Without dead ends: 608 [2019-12-26 22:42:00,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-26 22:42:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-26 22:42:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-26 22:42:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-26 22:42:00,131 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-26 22:42:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:00,131 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-26 22:42:00,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:42:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-26 22:42:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:42:00,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:00,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:00,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-26 22:42:00,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:00,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723334874] [2019-12-26 22:42:00,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:00,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723334874] [2019-12-26 22:42:00,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:00,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:42:00,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281225970] [2019-12-26 22:42:00,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:42:00,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:42:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:42:00,231 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-26 22:42:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:00,416 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-26 22:42:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:42:00,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-26 22:42:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:00,418 INFO L225 Difference]: With dead ends: 893 [2019-12-26 22:42:00,418 INFO L226 Difference]: Without dead ends: 893 [2019-12-26 22:42:00,419 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-26 22:42:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-26 22:42:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-26 22:42:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-26 22:42:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-26 22:42:00,431 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-26 22:42:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:00,432 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-26 22:42:00,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:42:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-26 22:42:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:42:00,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:00,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:00,435 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-26 22:42:00,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:00,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479715884] [2019-12-26 22:42:00,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:00,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479715884] [2019-12-26 22:42:00,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:00,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:42:00,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320304094] [2019-12-26 22:42:00,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:42:00,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:42:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:42:00,633 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 6 states. [2019-12-26 22:42:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:00,960 INFO L93 Difference]: Finished difference Result 989 states and 2304 transitions. [2019-12-26 22:42:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:42:00,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-26 22:42:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:00,963 INFO L225 Difference]: With dead ends: 989 [2019-12-26 22:42:00,963 INFO L226 Difference]: Without dead ends: 989 [2019-12-26 22:42:00,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:42:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-26 22:42:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 780. [2019-12-26 22:42:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-26 22:42:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1832 transitions. [2019-12-26 22:42:00,983 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1832 transitions. Word has length 55 [2019-12-26 22:42:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:00,983 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1832 transitions. [2019-12-26 22:42:00,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:42:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1832 transitions. [2019-12-26 22:42:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:42:00,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:00,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:00,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2089737911, now seen corresponding path program 3 times [2019-12-26 22:42:00,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:00,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534815445] [2019-12-26 22:42:00,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:01,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534815445] [2019-12-26 22:42:01,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:01,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:42:01,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439441142] [2019-12-26 22:42:01,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:42:01,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:42:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:42:01,124 INFO L87 Difference]: Start difference. First operand 780 states and 1832 transitions. Second operand 6 states. [2019-12-26 22:42:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:01,476 INFO L93 Difference]: Finished difference Result 1297 states and 3013 transitions. [2019-12-26 22:42:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:42:01,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-26 22:42:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:01,478 INFO L225 Difference]: With dead ends: 1297 [2019-12-26 22:42:01,479 INFO L226 Difference]: Without dead ends: 1297 [2019-12-26 22:42:01,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:42:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-26 22:42:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 840. [2019-12-26 22:42:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-26 22:42:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1982 transitions. [2019-12-26 22:42:01,497 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1982 transitions. Word has length 55 [2019-12-26 22:42:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:01,500 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1982 transitions. [2019-12-26 22:42:01,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:42:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1982 transitions. [2019-12-26 22:42:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:42:01,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:01,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:01,506 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1513553193, now seen corresponding path program 4 times [2019-12-26 22:42:01,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:01,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306018488] [2019-12-26 22:42:01,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:01,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306018488] [2019-12-26 22:42:01,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:01,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:42:01,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607031698] [2019-12-26 22:42:01,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:42:01,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:42:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:01,602 INFO L87 Difference]: Start difference. First operand 840 states and 1982 transitions. Second operand 3 states. [2019-12-26 22:42:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:01,619 INFO L93 Difference]: Finished difference Result 738 states and 1699 transitions. [2019-12-26 22:42:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:42:01,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:42:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:01,620 INFO L225 Difference]: With dead ends: 738 [2019-12-26 22:42:01,621 INFO L226 Difference]: Without dead ends: 738 [2019-12-26 22:42:01,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-26 22:42:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-26 22:42:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-26 22:42:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1699 transitions. [2019-12-26 22:42:01,632 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1699 transitions. Word has length 55 [2019-12-26 22:42:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:01,633 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1699 transitions. [2019-12-26 22:42:01,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:42:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1699 transitions. [2019-12-26 22:42:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:42:01,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:01,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:01,635 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -272893927, now seen corresponding path program 1 times [2019-12-26 22:42:01,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:01,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889809021] [2019-12-26 22:42:01,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:01,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889809021] [2019-12-26 22:42:01,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:01,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:42:01,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34580909] [2019-12-26 22:42:01,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:42:01,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:42:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:42:01,905 INFO L87 Difference]: Start difference. First operand 738 states and 1699 transitions. Second operand 9 states. [2019-12-26 22:42:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:02,311 INFO L93 Difference]: Finished difference Result 1423 states and 3013 transitions. [2019-12-26 22:42:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:42:02,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-26 22:42:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:02,313 INFO L225 Difference]: With dead ends: 1423 [2019-12-26 22:42:02,313 INFO L226 Difference]: Without dead ends: 988 [2019-12-26 22:42:02,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:42:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-26 22:42:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 676. [2019-12-26 22:42:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-12-26 22:42:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1520 transitions. [2019-12-26 22:42:02,325 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1520 transitions. Word has length 56 [2019-12-26 22:42:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:02,325 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 1520 transitions. [2019-12-26 22:42:02,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:42:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1520 transitions. [2019-12-26 22:42:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:42:02,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:02,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:02,328 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 332964395, now seen corresponding path program 2 times [2019-12-26 22:42:02,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:02,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075186930] [2019-12-26 22:42:02,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:02,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075186930] [2019-12-26 22:42:02,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:02,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:42:02,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803651160] [2019-12-26 22:42:02,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:42:02,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:42:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:02,393 INFO L87 Difference]: Start difference. First operand 676 states and 1520 transitions. Second operand 3 states. [2019-12-26 22:42:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:02,432 INFO L93 Difference]: Finished difference Result 676 states and 1519 transitions. [2019-12-26 22:42:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:42:02,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 22:42:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:02,434 INFO L225 Difference]: With dead ends: 676 [2019-12-26 22:42:02,434 INFO L226 Difference]: Without dead ends: 676 [2019-12-26 22:42:02,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:42:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-26 22:42:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 413. [2019-12-26 22:42:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-26 22:42:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 908 transitions. [2019-12-26 22:42:02,442 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 908 transitions. Word has length 56 [2019-12-26 22:42:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:02,443 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 908 transitions. [2019-12-26 22:42:02,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:42:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 908 transitions. [2019-12-26 22:42:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:42:02,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:02,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:02,445 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 704044892, now seen corresponding path program 1 times [2019-12-26 22:42:02,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:02,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879839692] [2019-12-26 22:42:02,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:02,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879839692] [2019-12-26 22:42:02,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:02,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:42:02,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826886080] [2019-12-26 22:42:02,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:42:02,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:02,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:42:02,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:42:02,539 INFO L87 Difference]: Start difference. First operand 413 states and 908 transitions. Second operand 5 states. [2019-12-26 22:42:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:02,592 INFO L93 Difference]: Finished difference Result 591 states and 1216 transitions. [2019-12-26 22:42:02,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:42:02,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-26 22:42:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:02,593 INFO L225 Difference]: With dead ends: 591 [2019-12-26 22:42:02,593 INFO L226 Difference]: Without dead ends: 209 [2019-12-26 22:42:02,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:42:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-26 22:42:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-26 22:42:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-26 22:42:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-26 22:42:02,597 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 57 [2019-12-26 22:42:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:02,598 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-26 22:42:02,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:42:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-26 22:42:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:42:02,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:02,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:02,599 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 2 times [2019-12-26 22:42:02,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:02,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877716116] [2019-12-26 22:42:02,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:42:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:42:02,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877716116] [2019-12-26 22:42:02,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:42:02,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:42:02,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289143819] [2019-12-26 22:42:02,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:42:02,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:42:02,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:42:02,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:42:02,791 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 12 states. [2019-12-26 22:42:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:42:03,119 INFO L93 Difference]: Finished difference Result 360 states and 604 transitions. [2019-12-26 22:42:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:42:03,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-26 22:42:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:42:03,120 INFO L225 Difference]: With dead ends: 360 [2019-12-26 22:42:03,120 INFO L226 Difference]: Without dead ends: 327 [2019-12-26 22:42:03,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:42:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-26 22:42:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-26 22:42:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-26 22:42:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-26 22:42:03,126 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-26 22:42:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:42:03,126 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-26 22:42:03,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:42:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-26 22:42:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:42:03,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:42:03,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:42:03,128 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:42:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:42:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 3 times [2019-12-26 22:42:03,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:42:03,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044746734] [2019-12-26 22:42:03,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:42:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:42:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:42:03,228 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:42:03,228 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:42:03,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25| 1) |v_#valid_62|) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1202~0.base_25| 4)) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25|)) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_45 0) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25|) |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd0~0_281 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1202~0.base_25|) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_~#t1202~0.base=|v_ULTIMATE.start_main_~#t1202~0.base_25|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_25|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ULTIMATE.start_main_~#t1202~0.offset=|v_ULTIMATE.start_main_~#t1202~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} 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, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1204~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, 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_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1204~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1202~0.base, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1203~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1203~0.offset, #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, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1202~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:42:03,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1203~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1203~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13|) |v_ULTIMATE.start_main_~#t1203~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1203~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1203~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1203~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1203~0.offset] because there is no mapped edge [2019-12-26 22:42:03,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13|) |v_ULTIMATE.start_main_~#t1204~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1204~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1204~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1204~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1204~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1204~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1204~0.base] because there is no mapped edge [2019-12-26 22:42:03,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:42:03,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 22:42:03,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1230480080 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1230480080 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1230480080|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1230480080 |P2Thread1of1ForFork0_#t~ite11_Out-1230480080|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1230480080, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1230480080} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1230480080, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1230480080|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1230480080} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 22:42:03,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-248374152 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-248374152 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-248374152 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-248374152 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-248374152|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-248374152 |P2Thread1of1ForFork0_#t~ite12_Out-248374152|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-248374152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-248374152, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-248374152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248374152} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-248374152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-248374152, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-248374152|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-248374152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248374152} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 22:42:03,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1586366560 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1586366560 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In1586366560 ~y$r_buff0_thd3~0_Out1586366560) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1586366560) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1586366560, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1586366560} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1586366560, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1586366560, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1586366560|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 22:42:03,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In820812910 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In820812910 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In820812910 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In820812910 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out820812910| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out820812910| ~y$r_buff1_thd3~0_In820812910)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In820812910, ~y$w_buff0_used~0=~y$w_buff0_used~0_In820812910, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In820812910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In820812910} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out820812910|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In820812910, ~y$w_buff0_used~0=~y$w_buff0_used~0_In820812910, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In820812910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In820812910} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 22:42:03,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:42:03,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-397197175 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-397197175 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-397197175 |P1Thread1of1ForFork2_#t~ite3_Out-397197175|) (not .cse1)) (and (= ~y~0_In-397197175 |P1Thread1of1ForFork2_#t~ite3_Out-397197175|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-397197175, ~y$w_buff1~0=~y$w_buff1~0_In-397197175, ~y~0=~y~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-397197175, ~y$w_buff1~0=~y$w_buff1~0_In-397197175, ~y~0=~y~0_In-397197175, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-397197175|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:42:03,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:42:03,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-214573511 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-214573511 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-214573511| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-214573511 |P1Thread1of1ForFork2_#t~ite5_Out-214573511|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-214573511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214573511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-214573511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214573511, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-214573511|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:42:03,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1798693962 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1798693962 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1798693962 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1798693962 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out1798693962| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1798693962 |P1Thread1of1ForFork2_#t~ite6_Out1798693962|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798693962, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1798693962, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798693962} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798693962, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1798693962, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1798693962|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798693962} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:42:03,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In497078788 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In497078788 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out497078788| 0)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out497078788| ~y$r_buff0_thd2~0_In497078788) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497078788} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497078788, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out497078788|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:42:03,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1471549891 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1471549891 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1471549891 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1471549891 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out1471549891| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite8_Out1471549891| ~y$r_buff1_thd2~0_In1471549891) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1471549891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471549891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1471549891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471549891} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1471549891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471549891, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1471549891|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1471549891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471549891} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:42:03,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:42:03,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:42:03,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1305699190 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out-1305699190| |ULTIMATE.start_main_#t~ite18_Out-1305699190|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1305699190 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-1305699190| ~y~0_In-1305699190) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-1305699190| ~y$w_buff1~0_In-1305699190) .cse0 (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1305699190, ~y~0=~y~0_In-1305699190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1305699190, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1305699190|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1305699190|, ~y~0=~y~0_In-1305699190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:42:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1611799854 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1611799854 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1611799854| ~y$w_buff0_used~0_In1611799854)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1611799854| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1611799854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1611799854, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1611799854|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:42:03,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In698661090 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In698661090 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In698661090 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In698661090 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out698661090| ~y$w_buff1_used~0_In698661090)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite21_Out698661090|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In698661090, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In698661090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698661090} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In698661090, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out698661090|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In698661090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698661090} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:42:03,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In267585950 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In267585950 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out267585950|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out267585950| ~y$r_buff0_thd0~0_In267585950)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In267585950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In267585950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In267585950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In267585950, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out267585950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:42:03,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1458240282 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1458240282 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1458240282 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1458240282 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1458240282| ~y$r_buff1_thd0~0_In-1458240282) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1458240282| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1458240282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1458240282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1458240282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1458240282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1458240282, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1458240282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1458240282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:42:03,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In371161405 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite33_Out371161405| |ULTIMATE.start_main_#t~ite32_Out371161405|) (= ~y$w_buff1~0_In371161405 |ULTIMATE.start_main_#t~ite32_Out371161405|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In371161405 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In371161405 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In371161405 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In371161405 256)))))) (and (= ~y$w_buff1~0_In371161405 |ULTIMATE.start_main_#t~ite33_Out371161405|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In371161405| |ULTIMATE.start_main_#t~ite32_Out371161405|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In371161405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In371161405, ~weak$$choice2~0=~weak$$choice2~0_In371161405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In371161405, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In371161405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} OutVars{~y$w_buff1~0=~y$w_buff1~0_In371161405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In371161405, ~weak$$choice2~0=~weak$$choice2~0_In371161405, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out371161405|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In371161405, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out371161405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-26 22:42:03,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1192543321 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_In-1192543321| |ULTIMATE.start_main_#t~ite35_Out-1192543321|) (not .cse0) (= ~y$w_buff0_used~0_In-1192543321 |ULTIMATE.start_main_#t~ite36_Out-1192543321|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1192543321 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1192543321 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1192543321 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1192543321 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite35_Out-1192543321| ~y$w_buff0_used~0_In-1192543321) (= |ULTIMATE.start_main_#t~ite35_Out-1192543321| |ULTIMATE.start_main_#t~ite36_Out-1192543321|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1192543321, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1192543321|, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1192543321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1192543321, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1192543321|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1192543321|, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1192543321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:42:03,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In123398912 256) 0))) (or (and (= ~y$w_buff1_used~0_In123398912 |ULTIMATE.start_main_#t~ite39_Out123398912|) (= |ULTIMATE.start_main_#t~ite38_In123398912| |ULTIMATE.start_main_#t~ite38_Out123398912|) (not .cse0)) (and (= ~y$w_buff1_used~0_In123398912 |ULTIMATE.start_main_#t~ite38_Out123398912|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In123398912 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In123398912 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In123398912 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In123398912 256)))) (= |ULTIMATE.start_main_#t~ite39_Out123398912| |ULTIMATE.start_main_#t~ite38_Out123398912|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In123398912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In123398912, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In123398912|, ~weak$$choice2~0=~weak$$choice2~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In123398912, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out123398912|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In123398912, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out123398912|, ~weak$$choice2~0=~weak$$choice2~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:42:03,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:42:03,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:42:03,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:42:03,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:42:03 BasicIcfg [2019-12-26 22:42:03,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:42:03,330 INFO L168 Benchmark]: Toolchain (without parser) took 17589.67 ms. Allocated memory was 145.8 MB in the beginning and 815.8 MB in the end (delta: 670.0 MB). Free memory was 100.5 MB in the beginning and 540.0 MB in the end (delta: -439.5 MB). Peak memory consumption was 230.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,331 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.23 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 157.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,338 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,339 INFO L168 Benchmark]: RCFGBuilder took 763.37 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 104.8 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,340 INFO L168 Benchmark]: TraceAbstraction took 15946.84 ms. Allocated memory was 203.4 MB in the beginning and 815.8 MB in the end (delta: 612.4 MB). Free memory was 104.2 MB in the beginning and 540.0 MB in the end (delta: -435.8 MB). Peak memory consumption was 176.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:42:03,348 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.23 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 157.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 153.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.37 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 104.8 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15946.84 ms. Allocated memory was 203.4 MB in the beginning and 815.8 MB in the end (delta: 612.4 MB). Free memory was 104.2 MB in the beginning and 540.0 MB in the end (delta: -435.8 MB). Peak memory consumption was 176.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L812] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 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) [L832] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1459 SDtfs, 1186 SDslu, 3038 SDs, 0 SdLazy, 1426 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3606 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 686 NumberOfCodeBlocks, 686 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 100582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...