/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:30:36,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:30:36,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:30:36,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:30:36,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:30:36,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:30:36,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:30:36,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:30:36,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:30:36,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:30:36,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:30:36,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:30:36,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:30:36,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:30:36,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:30:36,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:30:36,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:30:36,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:30:36,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:30:36,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:30:36,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:30:36,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:30:36,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:30:36,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:30:36,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:30:36,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:30:36,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:30:36,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:30:36,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:30:36,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:30:36,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:30:36,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:30:36,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:30:36,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:30:36,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:30:36,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:30:36,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:30:36,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:30:36,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:30:36,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:30:36,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:30:36,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:30:36,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:30:36,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:30:36,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:30:36,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:30:36,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:30:36,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:30:36,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:30:36,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:30:36,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:30:36,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:30:36,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:30:36,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:30:36,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:30:36,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:30:36,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:30:36,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:30:36,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:30:36,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:30:36,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:30:36,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:30:36,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:30:36,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:30:36,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:30:36,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:30:36,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:30:36,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:30:36,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:30:36,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:30:36,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:30:36,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:30:36,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:30:36,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:30:36,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:30:36,866 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:30:36,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 16:30:36,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e71cad1/605e97a25bdf436ba4b958545388c446/FLAG8bb7fa335 [2019-12-18 16:30:37,517 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:30:37,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 16:30:37,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e71cad1/605e97a25bdf436ba4b958545388c446/FLAG8bb7fa335 [2019-12-18 16:30:37,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e71cad1/605e97a25bdf436ba4b958545388c446 [2019-12-18 16:30:37,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:30:37,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:30:37,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:30:37,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:30:37,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:30:37,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:37" (1/1) ... [2019-12-18 16:30:37,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417d8fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:37, skipping insertion in model container [2019-12-18 16:30:37,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:37" (1/1) ... [2019-12-18 16:30:37,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:30:37,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:30:38,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:30:38,480 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:30:38,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:30:38,664 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:30:38,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38 WrapperNode [2019-12-18 16:30:38,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:30:38,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:30:38,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:30:38,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:30:38,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:30:38,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:30:38,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:30:38,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:30:38,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (1/1) ... [2019-12-18 16:30:38,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:30:38,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:30:38,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:30:38,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:30:38,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (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-18 16:30:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:30:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:30:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:30:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:30:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:30:38,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:30:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:30:38,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:30:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:30:38,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:30:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:30:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:30:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:30:38,840 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:30:39,604 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:30:39,604 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:30:39,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:30:39 BoogieIcfgContainer [2019-12-18 16:30:39,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:30:39,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:30:39,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:30:39,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:30:39,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:30:37" (1/3) ... [2019-12-18 16:30:39,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a2cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:30:39, skipping insertion in model container [2019-12-18 16:30:39,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:38" (2/3) ... [2019-12-18 16:30:39,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a2cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:30:39, skipping insertion in model container [2019-12-18 16:30:39,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:30:39" (3/3) ... [2019-12-18 16:30:39,615 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-18 16:30:39,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:30:39,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:30:39,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:30:39,635 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:30:39,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:30:39,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:30:39,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:30:39,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:30:39,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:30:39,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:30:39,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:30:39,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:30:39,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:30:39,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:30:39,830 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 16:30:39,832 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 16:30:39,927 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 16:30:39,927 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:30:39,947 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:30:39,975 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 16:30:40,019 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 16:30:40,019 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:30:40,028 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:30:40,048 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:30:40,050 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:30:44,911 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:30:45,373 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 16:30:45,528 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:30:45,565 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-18 16:30:45,566 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 16:30:45,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 16:30:56,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-18 16:30:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-18 16:30:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:30:56,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:30:56,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:30:56,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:30:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:30:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-18 16:30:56,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:30:56,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236318796] [2019-12-18 16:30:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:30:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:30:56,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-18 16:30:56,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236318796] [2019-12-18 16:30:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:30:56,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:30:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756754843] [2019-12-18 16:30:56,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:30:56,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:30:56,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:30:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:30:56,814 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-18 16:31:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:00,002 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-18 16:31:00,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:00,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:31:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:00,729 INFO L225 Difference]: With dead ends: 85100 [2019-12-18 16:31:00,729 INFO L226 Difference]: Without dead ends: 79822 [2019-12-18 16:31:00,731 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-18 16:31:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-18 16:31:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-18 16:31:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-18 16:31:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-18 16:31:08,263 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-18 16:31:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:08,263 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-18 16:31:08,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-18 16:31:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:31:08,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:08,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:08,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-18 16:31:08,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:08,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335504504] [2019-12-18 16:31:08,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:08,346 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-18 16:31:08,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335504504] [2019-12-18 16:31:08,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:08,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:08,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295639367] [2019-12-18 16:31:08,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:08,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:08,351 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-18 16:31:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:08,524 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-18 16:31:08,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:08,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:31:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:08,596 INFO L225 Difference]: With dead ends: 21012 [2019-12-18 16:31:08,597 INFO L226 Difference]: Without dead ends: 21012 [2019-12-18 16:31:08,598 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-18 16:31:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-18 16:31:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-18 16:31:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-18 16:31:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-18 16:31:09,218 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-18 16:31:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:09,219 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-18 16:31:09,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-18 16:31:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:31:09,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:09,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:09,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-18 16:31:09,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:09,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174390132] [2019-12-18 16:31:09,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:09,370 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-18 16:31:09,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174390132] [2019-12-18 16:31:09,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:09,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319433032] [2019-12-18 16:31:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:09,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:09,373 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-18 16:31:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:09,722 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-18 16:31:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:09,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:31:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:09,816 INFO L225 Difference]: With dead ends: 31168 [2019-12-18 16:31:09,816 INFO L226 Difference]: Without dead ends: 31154 [2019-12-18 16:31:09,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-18 16:31:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-18 16:31:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-18 16:31:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-18 16:31:12,199 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-18 16:31:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:12,199 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-18 16:31:12,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-18 16:31:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:31:12,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:12,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:12,202 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-18 16:31:12,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:12,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017952680] [2019-12-18 16:31:12,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:31:12,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017952680] [2019-12-18 16:31:12,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:12,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:12,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450489448] [2019-12-18 16:31:12,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:31:12,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:31:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:12,291 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-18 16:31:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:12,750 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-18 16:31:12,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:31:12,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 16:31:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:12,842 INFO L225 Difference]: With dead ends: 40618 [2019-12-18 16:31:12,842 INFO L226 Difference]: Without dead ends: 40602 [2019-12-18 16:31:12,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-18 16:31:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-18 16:31:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-18 16:31:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-18 16:31:13,837 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-18 16:31:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:13,838 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-18 16:31:13,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:31:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-18 16:31:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:31:13,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:13,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:13,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-18 16:31:13,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:13,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549246454] [2019-12-18 16:31:13,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:13,935 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-18 16:31:13,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549246454] [2019-12-18 16:31:13,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:13,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:31:13,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123430221] [2019-12-18 16:31:13,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:31:13,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:31:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:31:13,938 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-18 16:31:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:14,844 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-18 16:31:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:31:14,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:31:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:14,925 INFO L225 Difference]: With dead ends: 48617 [2019-12-18 16:31:14,925 INFO L226 Difference]: Without dead ends: 48589 [2019-12-18 16:31:14,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:31:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-18 16:31:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-18 16:31:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-18 16:31:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-18 16:31:16,024 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-18 16:31:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:16,024 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-18 16:31:16,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:31:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-18 16:31:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:31:16,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:16,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:16,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-18 16:31:16,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:16,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931415898] [2019-12-18 16:31:16,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:16,118 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-18 16:31:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931415898] [2019-12-18 16:31:16,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:16,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:16,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537099199] [2019-12-18 16:31:16,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:16,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:16,120 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 4 states. [2019-12-18 16:31:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:16,198 INFO L93 Difference]: Finished difference Result 13493 states and 41620 transitions. [2019-12-18 16:31:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:31:16,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:31:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:16,220 INFO L225 Difference]: With dead ends: 13493 [2019-12-18 16:31:16,220 INFO L226 Difference]: Without dead ends: 13493 [2019-12-18 16:31:16,221 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-18 16:31:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-18 16:31:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13273. [2019-12-18 16:31:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13273 states. [2019-12-18 16:31:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 40970 transitions. [2019-12-18 16:31:16,421 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 40970 transitions. Word has length 25 [2019-12-18 16:31:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:16,421 INFO L462 AbstractCegarLoop]: Abstraction has 13273 states and 40970 transitions. [2019-12-18 16:31:16,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 40970 transitions. [2019-12-18 16:31:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:31:16,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:16,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:16,441 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-18 16:31:16,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:16,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231561809] [2019-12-18 16:31:16,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:16,556 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-18 16:31:16,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231561809] [2019-12-18 16:31:16,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:16,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:31:16,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238966969] [2019-12-18 16:31:16,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:31:16,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:31:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:16,559 INFO L87 Difference]: Start difference. First operand 13273 states and 40970 transitions. Second operand 5 states. [2019-12-18 16:31:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:16,652 INFO L93 Difference]: Finished difference Result 12040 states and 37785 transitions. [2019-12-18 16:31:16,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:31:16,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 16:31:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:16,690 INFO L225 Difference]: With dead ends: 12040 [2019-12-18 16:31:16,690 INFO L226 Difference]: Without dead ends: 11998 [2019-12-18 16:31:16,691 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-18 16:31:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-12-18 16:31:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 11419. [2019-12-18 16:31:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-12-18 16:31:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 36001 transitions. [2019-12-18 16:31:16,963 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 36001 transitions. Word has length 39 [2019-12-18 16:31:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:16,963 INFO L462 AbstractCegarLoop]: Abstraction has 11419 states and 36001 transitions. [2019-12-18 16:31:16,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:31:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 36001 transitions. [2019-12-18 16:31:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:16,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:16,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:16,991 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-18 16:31:16,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:16,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896254472] [2019-12-18 16:31:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:17,110 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-18 16:31:17,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896254472] [2019-12-18 16:31:17,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:17,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:17,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163376972] [2019-12-18 16:31:17,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:31:17,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:31:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:31:17,112 INFO L87 Difference]: Start difference. First operand 11419 states and 36001 transitions. Second operand 4 states. [2019-12-18 16:31:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:17,220 INFO L93 Difference]: Finished difference Result 20766 states and 65459 transitions. [2019-12-18 16:31:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:31:17,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 16:31:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:17,244 INFO L225 Difference]: With dead ends: 20766 [2019-12-18 16:31:17,244 INFO L226 Difference]: Without dead ends: 9680 [2019-12-18 16:31:17,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:31:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2019-12-18 16:31:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9680. [2019-12-18 16:31:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2019-12-18 16:31:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 30383 transitions. [2019-12-18 16:31:17,583 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 30383 transitions. Word has length 53 [2019-12-18 16:31:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:17,583 INFO L462 AbstractCegarLoop]: Abstraction has 9680 states and 30383 transitions. [2019-12-18 16:31:17,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:31:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 30383 transitions. [2019-12-18 16:31:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:17,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:17,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] [2019-12-18 16:31:17,599 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-18 16:31:17,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:17,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155902027] [2019-12-18 16:31:17,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:17,695 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-18 16:31:17,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155902027] [2019-12-18 16:31:17,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:17,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:31:17,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426498527] [2019-12-18 16:31:17,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:31:17,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:31:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:17,698 INFO L87 Difference]: Start difference. First operand 9680 states and 30383 transitions. Second operand 7 states. [2019-12-18 16:31:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:18,118 INFO L93 Difference]: Finished difference Result 24579 states and 76915 transitions. [2019-12-18 16:31:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:31:18,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:31:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:18,150 INFO L225 Difference]: With dead ends: 24579 [2019-12-18 16:31:18,150 INFO L226 Difference]: Without dead ends: 19443 [2019-12-18 16:31:18,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:31:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-18 16:31:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 11624. [2019-12-18 16:31:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-12-18 16:31:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 36702 transitions. [2019-12-18 16:31:18,386 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 36702 transitions. Word has length 53 [2019-12-18 16:31:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:18,386 INFO L462 AbstractCegarLoop]: Abstraction has 11624 states and 36702 transitions. [2019-12-18 16:31:18,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:31:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 36702 transitions. [2019-12-18 16:31:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:18,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:18,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:18,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-18 16:31:18,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:18,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863756896] [2019-12-18 16:31:18,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:18,530 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-18 16:31:18,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863756896] [2019-12-18 16:31:18,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:18,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:31:18,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639248864] [2019-12-18 16:31:18,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:31:18,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:31:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:18,532 INFO L87 Difference]: Start difference. First operand 11624 states and 36702 transitions. Second operand 7 states. [2019-12-18 16:31:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:19,009 INFO L93 Difference]: Finished difference Result 29614 states and 91402 transitions. [2019-12-18 16:31:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:31:19,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:31:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:19,052 INFO L225 Difference]: With dead ends: 29614 [2019-12-18 16:31:19,052 INFO L226 Difference]: Without dead ends: 21210 [2019-12-18 16:31:19,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:31:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2019-12-18 16:31:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 13657. [2019-12-18 16:31:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-18 16:31:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 42965 transitions. [2019-12-18 16:31:19,337 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 42965 transitions. Word has length 53 [2019-12-18 16:31:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:19,337 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 42965 transitions. [2019-12-18 16:31:19,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:31:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 42965 transitions. [2019-12-18 16:31:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:19,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:19,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:19,357 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-18 16:31:19,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:19,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613279945] [2019-12-18 16:31:19,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:19,451 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-18 16:31:19,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613279945] [2019-12-18 16:31:19,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:19,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:31:19,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126024143] [2019-12-18 16:31:19,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:31:19,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:31:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:19,453 INFO L87 Difference]: Start difference. First operand 13657 states and 42965 transitions. Second operand 7 states. [2019-12-18 16:31:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:19,960 INFO L93 Difference]: Finished difference Result 27460 states and 85976 transitions. [2019-12-18 16:31:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:31:19,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:31:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:19,995 INFO L225 Difference]: With dead ends: 27460 [2019-12-18 16:31:19,996 INFO L226 Difference]: Without dead ends: 25402 [2019-12-18 16:31:19,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:31:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25402 states. [2019-12-18 16:31:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25402 to 13726. [2019-12-18 16:31:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13726 states. [2019-12-18 16:31:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 43266 transitions. [2019-12-18 16:31:20,261 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 43266 transitions. Word has length 53 [2019-12-18 16:31:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:20,261 INFO L462 AbstractCegarLoop]: Abstraction has 13726 states and 43266 transitions. [2019-12-18 16:31:20,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:31:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 43266 transitions. [2019-12-18 16:31:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:20,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:20,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:20,276 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-18 16:31:20,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:20,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237112415] [2019-12-18 16:31:20,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:20,338 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-18 16:31:20,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237112415] [2019-12-18 16:31:20,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:20,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:20,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979852429] [2019-12-18 16:31:20,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:20,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:20,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:20,340 INFO L87 Difference]: Start difference. First operand 13726 states and 43266 transitions. Second operand 3 states. [2019-12-18 16:31:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:20,441 INFO L93 Difference]: Finished difference Result 18812 states and 59147 transitions. [2019-12-18 16:31:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:31:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:20,468 INFO L225 Difference]: With dead ends: 18812 [2019-12-18 16:31:20,469 INFO L226 Difference]: Without dead ends: 18812 [2019-12-18 16:31:20,469 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-18 16:31:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18812 states. [2019-12-18 16:31:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18812 to 16902. [2019-12-18 16:31:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2019-12-18 16:31:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 53223 transitions. [2019-12-18 16:31:20,765 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 53223 transitions. Word has length 53 [2019-12-18 16:31:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:20,766 INFO L462 AbstractCegarLoop]: Abstraction has 16902 states and 53223 transitions. [2019-12-18 16:31:20,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 53223 transitions. [2019-12-18 16:31:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:20,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:20,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:20,791 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-18 16:31:20,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:20,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305257496] [2019-12-18 16:31:20,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:20,866 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-18 16:31:20,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305257496] [2019-12-18 16:31:20,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:20,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:31:20,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988102829] [2019-12-18 16:31:20,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:20,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:20,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:20,870 INFO L87 Difference]: Start difference. First operand 16902 states and 53223 transitions. Second operand 3 states. [2019-12-18 16:31:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:20,974 INFO L93 Difference]: Finished difference Result 18773 states and 56435 transitions. [2019-12-18 16:31:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:20,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:31:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:21,002 INFO L225 Difference]: With dead ends: 18773 [2019-12-18 16:31:21,002 INFO L226 Difference]: Without dead ends: 18104 [2019-12-18 16:31:21,002 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-18 16:31:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-18 16:31:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 15749. [2019-12-18 16:31:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-18 16:31:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-18 16:31:21,285 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-18 16:31:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:21,285 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-18 16:31:21,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-18 16:31:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:21,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:21,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:21,306 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-18 16:31:21,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:21,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281660642] [2019-12-18 16:31:21,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:21,415 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-18 16:31:21,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281660642] [2019-12-18 16:31:21,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:21,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:31:21,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428845915] [2019-12-18 16:31:21,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:31:21,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:31:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:31:21,417 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 7 states. [2019-12-18 16:31:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:22,373 INFO L93 Difference]: Finished difference Result 26751 states and 78312 transitions. [2019-12-18 16:31:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:31:22,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:31:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:22,409 INFO L225 Difference]: With dead ends: 26751 [2019-12-18 16:31:22,409 INFO L226 Difference]: Without dead ends: 26641 [2019-12-18 16:31:22,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:31:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-12-18 16:31:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 19681. [2019-12-18 16:31:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-18 16:31:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-18 16:31:22,747 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-18 16:31:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:22,747 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-18 16:31:22,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:31:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-18 16:31:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:22,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:22,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:22,770 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-18 16:31:22,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:22,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579383566] [2019-12-18 16:31:22,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:22,914 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-18 16:31:22,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579383566] [2019-12-18 16:31:22,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:22,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:31:22,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320427741] [2019-12-18 16:31:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:31:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:31:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:31:22,916 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 8 states. [2019-12-18 16:31:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:24,319 INFO L93 Difference]: Finished difference Result 38250 states and 112084 transitions. [2019-12-18 16:31:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:31:24,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 16:31:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:24,374 INFO L225 Difference]: With dead ends: 38250 [2019-12-18 16:31:24,375 INFO L226 Difference]: Without dead ends: 38140 [2019-12-18 16:31:24,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:31:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2019-12-18 16:31:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 20676. [2019-12-18 16:31:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20676 states. [2019-12-18 16:31:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20676 states to 20676 states and 61780 transitions. [2019-12-18 16:31:24,832 INFO L78 Accepts]: Start accepts. Automaton has 20676 states and 61780 transitions. Word has length 53 [2019-12-18 16:31:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:24,832 INFO L462 AbstractCegarLoop]: Abstraction has 20676 states and 61780 transitions. [2019-12-18 16:31:24,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:31:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20676 states and 61780 transitions. [2019-12-18 16:31:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:31:24,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:24,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:24,858 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-18 16:31:24,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:24,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862102605] [2019-12-18 16:31:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:24,927 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-18 16:31:24,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862102605] [2019-12-18 16:31:24,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:24,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:24,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121424869] [2019-12-18 16:31:24,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:24,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:24,929 INFO L87 Difference]: Start difference. First operand 20676 states and 61780 transitions. Second operand 3 states. [2019-12-18 16:31:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:25,138 INFO L93 Difference]: Finished difference Result 20676 states and 61778 transitions. [2019-12-18 16:31:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:25,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:31:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:25,182 INFO L225 Difference]: With dead ends: 20676 [2019-12-18 16:31:25,182 INFO L226 Difference]: Without dead ends: 20676 [2019-12-18 16:31:25,182 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-18 16:31:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2019-12-18 16:31:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 16261. [2019-12-18 16:31:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-12-18 16:31:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 49687 transitions. [2019-12-18 16:31:25,521 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 49687 transitions. Word has length 53 [2019-12-18 16:31:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:25,522 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 49687 transitions. [2019-12-18 16:31:25,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 49687 transitions. [2019-12-18 16:31:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:31:25,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:25,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:31:25,541 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash -6191814, now seen corresponding path program 1 times [2019-12-18 16:31:25,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:25,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3452272] [2019-12-18 16:31:25,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:25,599 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-18 16:31:25,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3452272] [2019-12-18 16:31:25,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:25,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:31:25,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228627282] [2019-12-18 16:31:25,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:31:25,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:31:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:31:25,601 INFO L87 Difference]: Start difference. First operand 16261 states and 49687 transitions. Second operand 3 states. [2019-12-18 16:31:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:25,658 INFO L93 Difference]: Finished difference Result 12476 states and 37450 transitions. [2019-12-18 16:31:25,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:31:25,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:31:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:25,679 INFO L225 Difference]: With dead ends: 12476 [2019-12-18 16:31:25,679 INFO L226 Difference]: Without dead ends: 12476 [2019-12-18 16:31:25,680 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-18 16:31:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2019-12-18 16:31:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 11767. [2019-12-18 16:31:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11767 states. [2019-12-18 16:31:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11767 states to 11767 states and 35347 transitions. [2019-12-18 16:31:25,954 INFO L78 Accepts]: Start accepts. Automaton has 11767 states and 35347 transitions. Word has length 54 [2019-12-18 16:31:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:25,954 INFO L462 AbstractCegarLoop]: Abstraction has 11767 states and 35347 transitions. [2019-12-18 16:31:25,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:31:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11767 states and 35347 transitions. [2019-12-18 16:31:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:25,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:25,973 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-18 16:31:25,973 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:25,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 1 times [2019-12-18 16:31:25,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:25,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703267051] [2019-12-18 16:31:25,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:26,076 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-18 16:31:26,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703267051] [2019-12-18 16:31:26,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:26,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:31:26,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088080769] [2019-12-18 16:31:26,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:31:26,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:26,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:31:26,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:31:26,086 INFO L87 Difference]: Start difference. First operand 11767 states and 35347 transitions. Second operand 8 states. [2019-12-18 16:31:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:27,263 INFO L93 Difference]: Finished difference Result 22675 states and 67447 transitions. [2019-12-18 16:31:27,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:31:27,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 16:31:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:27,289 INFO L225 Difference]: With dead ends: 22675 [2019-12-18 16:31:27,290 INFO L226 Difference]: Without dead ends: 18316 [2019-12-18 16:31:27,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:31:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18316 states. [2019-12-18 16:31:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18316 to 12308. [2019-12-18 16:31:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-18 16:31:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 36615 transitions. [2019-12-18 16:31:27,508 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 36615 transitions. Word has length 55 [2019-12-18 16:31:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:27,508 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 36615 transitions. [2019-12-18 16:31:27,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:31:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 36615 transitions. [2019-12-18 16:31:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:27,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:27,521 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-18 16:31:27,521 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 2 times [2019-12-18 16:31:27,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:27,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665239145] [2019-12-18 16:31:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:27,638 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-18 16:31:27,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665239145] [2019-12-18 16:31:27,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:27,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:31:27,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850531936] [2019-12-18 16:31:27,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:31:27,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:31:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:31:27,640 INFO L87 Difference]: Start difference. First operand 12308 states and 36615 transitions. Second operand 9 states. [2019-12-18 16:31:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:28,623 INFO L93 Difference]: Finished difference Result 21113 states and 62320 transitions. [2019-12-18 16:31:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:31:28,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 16:31:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:28,647 INFO L225 Difference]: With dead ends: 21113 [2019-12-18 16:31:28,647 INFO L226 Difference]: Without dead ends: 17884 [2019-12-18 16:31:28,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:31:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-12-18 16:31:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 12140. [2019-12-18 16:31:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12140 states. [2019-12-18 16:31:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12140 states to 12140 states and 36091 transitions. [2019-12-18 16:31:28,930 INFO L78 Accepts]: Start accepts. Automaton has 12140 states and 36091 transitions. Word has length 55 [2019-12-18 16:31:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:28,930 INFO L462 AbstractCegarLoop]: Abstraction has 12140 states and 36091 transitions. [2019-12-18 16:31:28,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:31:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 12140 states and 36091 transitions. [2019-12-18 16:31:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:28,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:28,947 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-18 16:31:28,948 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 3 times [2019-12-18 16:31:28,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:28,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889052327] [2019-12-18 16:31:28,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:29,455 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-18 16:31:29,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889052327] [2019-12-18 16:31:29,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:29,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:31:29,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106449301] [2019-12-18 16:31:29,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:31:29,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:31:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:31:29,459 INFO L87 Difference]: Start difference. First operand 12140 states and 36091 transitions. Second operand 15 states. [2019-12-18 16:31:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:33,481 INFO L93 Difference]: Finished difference Result 27231 states and 79196 transitions. [2019-12-18 16:31:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 16:31:33,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 16:31:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:33,518 INFO L225 Difference]: With dead ends: 27231 [2019-12-18 16:31:33,518 INFO L226 Difference]: Without dead ends: 26545 [2019-12-18 16:31:33,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=3557, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 16:31:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26545 states. [2019-12-18 16:31:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26545 to 14182. [2019-12-18 16:31:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14182 states. [2019-12-18 16:31:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14182 states to 14182 states and 41823 transitions. [2019-12-18 16:31:33,833 INFO L78 Accepts]: Start accepts. Automaton has 14182 states and 41823 transitions. Word has length 55 [2019-12-18 16:31:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:33,833 INFO L462 AbstractCegarLoop]: Abstraction has 14182 states and 41823 transitions. [2019-12-18 16:31:33,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:31:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14182 states and 41823 transitions. [2019-12-18 16:31:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:33,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:33,849 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-18 16:31:33,849 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1540693839, now seen corresponding path program 4 times [2019-12-18 16:31:33,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025374510] [2019-12-18 16:31:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:34,427 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-18 16:31:34,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025374510] [2019-12-18 16:31:34,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:34,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:31:34,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226581259] [2019-12-18 16:31:34,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:31:34,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:31:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:31:34,429 INFO L87 Difference]: Start difference. First operand 14182 states and 41823 transitions. Second operand 15 states. [2019-12-18 16:31:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:37,854 INFO L93 Difference]: Finished difference Result 26877 states and 77568 transitions. [2019-12-18 16:31:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 16:31:37,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 16:31:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:37,883 INFO L225 Difference]: With dead ends: 26877 [2019-12-18 16:31:37,883 INFO L226 Difference]: Without dead ends: 21485 [2019-12-18 16:31:37,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 16:31:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21485 states. [2019-12-18 16:31:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21485 to 12008. [2019-12-18 16:31:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12008 states. [2019-12-18 16:31:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 35667 transitions. [2019-12-18 16:31:38,111 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 35667 transitions. Word has length 55 [2019-12-18 16:31:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:38,111 INFO L462 AbstractCegarLoop]: Abstraction has 12008 states and 35667 transitions. [2019-12-18 16:31:38,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:31:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 35667 transitions. [2019-12-18 16:31:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:38,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:38,124 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-18 16:31:38,124 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 5 times [2019-12-18 16:31:38,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:38,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091531137] [2019-12-18 16:31:38,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:38,703 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-18 16:31:38,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091531137] [2019-12-18 16:31:38,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:38,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 16:31:38,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587193347] [2019-12-18 16:31:38,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 16:31:38,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 16:31:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:31:38,706 INFO L87 Difference]: Start difference. First operand 12008 states and 35667 transitions. Second operand 19 states. [2019-12-18 16:31:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:43,017 INFO L93 Difference]: Finished difference Result 19507 states and 56853 transitions. [2019-12-18 16:31:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 16:31:43,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-18 16:31:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:43,042 INFO L225 Difference]: With dead ends: 19507 [2019-12-18 16:31:43,042 INFO L226 Difference]: Without dead ends: 18225 [2019-12-18 16:31:43,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 16:31:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18225 states. [2019-12-18 16:31:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18225 to 12176. [2019-12-18 16:31:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-18 16:31:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 36073 transitions. [2019-12-18 16:31:43,253 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 36073 transitions. Word has length 55 [2019-12-18 16:31:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:43,253 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 36073 transitions. [2019-12-18 16:31:43,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 16:31:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 36073 transitions. [2019-12-18 16:31:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:43,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:43,265 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-18 16:31:43,265 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2097033317, now seen corresponding path program 6 times [2019-12-18 16:31:43,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:43,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106902003] [2019-12-18 16:31:43,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:43,815 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-18 16:31:43,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106902003] [2019-12-18 16:31:43,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:43,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:31:43,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493123934] [2019-12-18 16:31:43,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:31:43,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:31:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:31:43,820 INFO L87 Difference]: Start difference. First operand 12176 states and 36073 transitions. Second operand 16 states. [2019-12-18 16:31:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:47,836 INFO L93 Difference]: Finished difference Result 22114 states and 64715 transitions. [2019-12-18 16:31:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 16:31:47,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 16:31:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:47,867 INFO L225 Difference]: With dead ends: 22114 [2019-12-18 16:31:47,867 INFO L226 Difference]: Without dead ends: 21876 [2019-12-18 16:31:47,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 16:31:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21876 states. [2019-12-18 16:31:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21876 to 12800. [2019-12-18 16:31:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12800 states. [2019-12-18 16:31:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12800 states to 12800 states and 37725 transitions. [2019-12-18 16:31:48,204 INFO L78 Accepts]: Start accepts. Automaton has 12800 states and 37725 transitions. Word has length 55 [2019-12-18 16:31:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:48,204 INFO L462 AbstractCegarLoop]: Abstraction has 12800 states and 37725 transitions. [2019-12-18 16:31:48,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:31:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12800 states and 37725 transitions. [2019-12-18 16:31:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:48,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:48,218 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-18 16:31:48,218 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2101751141, now seen corresponding path program 7 times [2019-12-18 16:31:48,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:48,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909921865] [2019-12-18 16:31:48,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:48,662 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-18 16:31:48,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909921865] [2019-12-18 16:31:48,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:48,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:31:48,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18209105] [2019-12-18 16:31:48,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:31:48,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:31:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:31:48,664 INFO L87 Difference]: Start difference. First operand 12800 states and 37725 transitions. Second operand 16 states. [2019-12-18 16:31:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:51,944 INFO L93 Difference]: Finished difference Result 22104 states and 64419 transitions. [2019-12-18 16:31:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 16:31:51,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 16:31:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:51,977 INFO L225 Difference]: With dead ends: 22104 [2019-12-18 16:31:51,977 INFO L226 Difference]: Without dead ends: 21232 [2019-12-18 16:31:51,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=1785, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 16:31:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21232 states. [2019-12-18 16:31:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21232 to 12032. [2019-12-18 16:31:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12032 states. [2019-12-18 16:31:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12032 states to 12032 states and 35713 transitions. [2019-12-18 16:31:52,218 INFO L78 Accepts]: Start accepts. Automaton has 12032 states and 35713 transitions. Word has length 55 [2019-12-18 16:31:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:52,219 INFO L462 AbstractCegarLoop]: Abstraction has 12032 states and 35713 transitions. [2019-12-18 16:31:52,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:31:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12032 states and 35713 transitions. [2019-12-18 16:31:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:52,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:52,232 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-18 16:31:52,232 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 8 times [2019-12-18 16:31:52,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:52,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166987817] [2019-12-18 16:31:52,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:52,660 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-18 16:31:52,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166987817] [2019-12-18 16:31:52,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:52,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:31:52,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452959978] [2019-12-18 16:31:52,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:31:52,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:31:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:31:52,663 INFO L87 Difference]: Start difference. First operand 12032 states and 35713 transitions. Second operand 17 states. [2019-12-18 16:31:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:55,984 INFO L93 Difference]: Finished difference Result 22503 states and 65615 transitions. [2019-12-18 16:31:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 16:31:55,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-18 16:31:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:56,012 INFO L225 Difference]: With dead ends: 22503 [2019-12-18 16:31:56,012 INFO L226 Difference]: Without dead ends: 21203 [2019-12-18 16:31:56,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=470, Invalid=2610, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 16:31:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21203 states. [2019-12-18 16:31:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21203 to 12176. [2019-12-18 16:31:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-18 16:31:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 36082 transitions. [2019-12-18 16:31:56,238 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 36082 transitions. Word has length 55 [2019-12-18 16:31:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:56,238 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 36082 transitions. [2019-12-18 16:31:56,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:31:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 36082 transitions. [2019-12-18 16:31:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:56,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:56,251 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-18 16:31:56,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash 907067057, now seen corresponding path program 9 times [2019-12-18 16:31:56,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:56,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481348765] [2019-12-18 16:31:56,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:56,452 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-18 16:31:56,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481348765] [2019-12-18 16:31:56,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:56,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:31:56,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052476387] [2019-12-18 16:31:56,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:31:56,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:31:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:31:56,454 INFO L87 Difference]: Start difference. First operand 12176 states and 36082 transitions. Second operand 11 states. [2019-12-18 16:31:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:57,461 INFO L93 Difference]: Finished difference Result 21440 states and 63273 transitions. [2019-12-18 16:31:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:31:57,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:31:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:57,495 INFO L225 Difference]: With dead ends: 21440 [2019-12-18 16:31:57,495 INFO L226 Difference]: Without dead ends: 20874 [2019-12-18 16:31:57,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:31:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20874 states. [2019-12-18 16:31:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20874 to 13565. [2019-12-18 16:31:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13565 states. [2019-12-18 16:31:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13565 states to 13565 states and 40023 transitions. [2019-12-18 16:31:57,738 INFO L78 Accepts]: Start accepts. Automaton has 13565 states and 40023 transitions. Word has length 55 [2019-12-18 16:31:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:31:57,739 INFO L462 AbstractCegarLoop]: Abstraction has 13565 states and 40023 transitions. [2019-12-18 16:31:57,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:31:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13565 states and 40023 transitions. [2019-12-18 16:31:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:31:57,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:31:57,753 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-18 16:31:57,753 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:31:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:31:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash 902349233, now seen corresponding path program 10 times [2019-12-18 16:31:57,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:31:57,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858124128] [2019-12-18 16:31:57,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:31:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:31:58,219 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-18 16:31:58,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858124128] [2019-12-18 16:31:58,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:31:58,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 16:31:58,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266812994] [2019-12-18 16:31:58,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 16:31:58,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:31:58,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 16:31:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:31:58,221 INFO L87 Difference]: Start difference. First operand 13565 states and 40023 transitions. Second operand 16 states. [2019-12-18 16:31:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:31:59,760 INFO L93 Difference]: Finished difference Result 16627 states and 48443 transitions. [2019-12-18 16:31:59,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 16:31:59,760 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 16:31:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:31:59,782 INFO L225 Difference]: With dead ends: 16627 [2019-12-18 16:31:59,782 INFO L226 Difference]: Without dead ends: 16315 [2019-12-18 16:31:59,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:31:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16315 states. [2019-12-18 16:32:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16315 to 13689. [2019-12-18 16:32:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13689 states. [2019-12-18 16:32:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13689 states to 13689 states and 40374 transitions. [2019-12-18 16:32:00,073 INFO L78 Accepts]: Start accepts. Automaton has 13689 states and 40374 transitions. Word has length 55 [2019-12-18 16:32:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:00,073 INFO L462 AbstractCegarLoop]: Abstraction has 13689 states and 40374 transitions. [2019-12-18 16:32:00,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 16:32:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 13689 states and 40374 transitions. [2019-12-18 16:32:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:32:00,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:00,088 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-18 16:32:00,088 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 824934773, now seen corresponding path program 11 times [2019-12-18 16:32:00,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820856218] [2019-12-18 16:32:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:00,283 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-18 16:32:00,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820856218] [2019-12-18 16:32:00,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:00,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:32:00,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793913062] [2019-12-18 16:32:00,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:32:00,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:32:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:32:00,285 INFO L87 Difference]: Start difference. First operand 13689 states and 40374 transitions. Second operand 11 states. [2019-12-18 16:32:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:01,157 INFO L93 Difference]: Finished difference Result 21322 states and 62414 transitions. [2019-12-18 16:32:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:32:01,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:32:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:01,181 INFO L225 Difference]: With dead ends: 21322 [2019-12-18 16:32:01,181 INFO L226 Difference]: Without dead ends: 17993 [2019-12-18 16:32:01,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:32:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-18 16:32:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 11486. [2019-12-18 16:32:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11486 states. [2019-12-18 16:32:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34223 transitions. [2019-12-18 16:32:01,393 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34223 transitions. Word has length 55 [2019-12-18 16:32:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:01,393 INFO L462 AbstractCegarLoop]: Abstraction has 11486 states and 34223 transitions. [2019-12-18 16:32:01,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:32:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34223 transitions. [2019-12-18 16:32:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:32:01,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:01,405 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-18 16:32:01,405 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 12 times [2019-12-18 16:32:01,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:01,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150800832] [2019-12-18 16:32:01,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:32:01,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:32:01,502 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:32:01,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40|) |v_ULTIMATE.start_main_~#t424~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40|)) (= v_~x$r_buff0_thd0~0_141 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40| 1)) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_28|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t424~0.base_40|) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_40| 4) |v_#length_21|) (= v_~x$r_buff1_thd0~0_274 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_28|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_32|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_40|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 16:32:01,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:32:01,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 16:32:01,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:32:01,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1343406558 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1343406558 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1343406558 |P2Thread1of1ForFork1_#t~ite32_Out1343406558|)) (and (= ~x~0_In1343406558 |P2Thread1of1ForFork1_#t~ite32_Out1343406558|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1343406558, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1343406558, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1343406558, ~x~0=~x~0_In1343406558} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1343406558|, ~x$w_buff1~0=~x$w_buff1~0_In1343406558, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1343406558, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1343406558, ~x~0=~x~0_In1343406558} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 16:32:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1839619775 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1839619775 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1839619775|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1839619775| ~x$w_buff0_used~0_In-1839619775) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1839619775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1839619775} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1839619775, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1839619775|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1839619775} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 16:32:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1465884911 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1465884911 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1465884911 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1465884911 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1465884911| ~x$w_buff1_used~0_In1465884911) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out1465884911| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1465884911, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1465884911, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1465884911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465884911} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1465884911, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1465884911, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1465884911, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1465884911|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465884911} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:32:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-48654215 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-48654215 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-48654215 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-48654215 ~x$r_buff0_thd2~0_Out-48654215)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48654215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48654215} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-48654215|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-48654215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48654215} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:32:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1544940798 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1544940798 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1544940798 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1544940798 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1544940798|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1544940798 |P1Thread1of1ForFork0_#t~ite31_Out1544940798|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1544940798, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1544940798, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1544940798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1544940798} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1544940798|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1544940798, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1544940798, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1544940798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1544940798} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:32:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 16:32:01,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In175604660 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out175604660| |P0Thread1of1ForFork2_#t~ite14_Out175604660|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In175604660 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In175604660 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In175604660 256) 0)) (= (mod ~x$w_buff0_used~0_In175604660 256) 0))) (= |P0Thread1of1ForFork2_#t~ite14_Out175604660| ~x$w_buff0_used~0_In175604660)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out175604660| ~x$w_buff0_used~0_In175604660) (= |P0Thread1of1ForFork2_#t~ite14_In175604660| |P0Thread1of1ForFork2_#t~ite14_Out175604660|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175604660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In175604660, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In175604660, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In175604660|, ~weak$$choice2~0=~weak$$choice2~0_In175604660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175604660} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175604660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In175604660, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out175604660|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In175604660, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out175604660|, ~weak$$choice2~0=~weak$$choice2~0_In175604660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175604660} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:32:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1080722676 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1080722676 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In-1080722676 256) 0)) (.cse5 (= (mod ~x$r_buff1_thd1~0_In-1080722676 256) 0)) (.cse2 (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| |P0Thread1of1ForFork2_#t~ite18_Out-1080722676|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1080722676 256)))) (or (let ((.cse4 (not .cse6))) (and .cse0 (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| |P0Thread1of1ForFork2_#t~ite16_Out-1080722676|) .cse2 (= |P0Thread1of1ForFork2_#t~ite16_Out-1080722676| 0) (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and .cse0 (or .cse1 (and .cse3 .cse6) (and .cse6 .cse5)) (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| ~x$w_buff1_used~0_In-1080722676) .cse2) (and (= ~x$w_buff1_used~0_In-1080722676 |P0Thread1of1ForFork2_#t~ite18_Out-1080722676|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| |P0Thread1of1ForFork2_#t~ite17_In-1080722676|))) (= |P0Thread1of1ForFork2_#t~ite16_In-1080722676| |P0Thread1of1ForFork2_#t~ite16_Out-1080722676|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080722676, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1080722676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080722676, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-1080722676|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080722676, ~weak$$choice2~0=~weak$$choice2~0_In-1080722676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080722676} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080722676, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1080722676|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1080722676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080722676, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-1080722676|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080722676, ~weak$$choice2~0=~weak$$choice2~0_In-1080722676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080722676} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 16:32:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:32:01,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 16:32:01,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 16:32:01,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1854950883 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1854950883 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1854950883 |P2Thread1of1ForFork1_#t~ite34_Out-1854950883|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1854950883|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1854950883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854950883} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1854950883|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1854950883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854950883} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:32:01,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1704639738 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1704639738 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1704639738 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1704639738 256) 0))) (or (and (= ~x$w_buff1_used~0_In1704639738 |P2Thread1of1ForFork1_#t~ite35_Out1704639738|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1704639738|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1704639738, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704639738, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704639738, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704639738} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1704639738|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704639738, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704639738, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704639738, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704639738} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:32:01,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1402242647 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1402242647 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1402242647|)) (and (= ~x$r_buff0_thd3~0_In1402242647 |P2Thread1of1ForFork1_#t~ite36_Out1402242647|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1402242647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402242647} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1402242647|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1402242647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402242647} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:32:01,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2060136840 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2060136840 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2060136840 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-2060136840 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-2060136840| ~x$r_buff1_thd3~0_In-2060136840)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-2060136840| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2060136840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2060136840, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2060136840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2060136840} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2060136840|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2060136840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2060136840, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2060136840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2060136840} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:32:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 16:32:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:32:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1898925880| |ULTIMATE.start_main_#t~ite41_Out-1898925880|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1898925880 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1898925880 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1898925880| ~x~0_In-1898925880) (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In-1898925880 |ULTIMATE.start_main_#t~ite41_Out-1898925880|) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1898925880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1898925880, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1898925880, ~x~0=~x~0_In-1898925880} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1898925880|, ~x$w_buff1~0=~x$w_buff1~0_In-1898925880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1898925880, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1898925880, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1898925880|, ~x~0=~x~0_In-1898925880} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:32:01,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-477912967 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-477912967 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-477912967| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-477912967| ~x$w_buff0_used~0_In-477912967)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-477912967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477912967} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-477912967, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-477912967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477912967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:32:01,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2135041823 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2135041823 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2135041823 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2135041823 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-2135041823|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2135041823 |ULTIMATE.start_main_#t~ite44_Out-2135041823|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2135041823, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135041823, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135041823, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2135041823} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2135041823, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135041823, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135041823, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2135041823|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2135041823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:32:01,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1876830622 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1876830622 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1876830622| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1876830622 |ULTIMATE.start_main_#t~ite45_Out-1876830622|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1876830622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1876830622} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1876830622, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1876830622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1876830622} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:32:01,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1621372488 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1621372488 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1621372488 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1621372488 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1621372488| ~x$r_buff1_thd0~0_In-1621372488) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out-1621372488| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621372488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1621372488, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1621372488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621372488} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621372488, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1621372488|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1621372488, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1621372488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621372488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:32:01,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:32:01,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:32:01 BasicIcfg [2019-12-18 16:32:01,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:32:01,632 INFO L168 Benchmark]: Toolchain (without parser) took 83835.62 ms. Allocated memory was 147.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 103.9 MB in the beginning and 1.1 GB in the end (delta: -980.7 MB). Peak memory consumption was 924.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,633 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.42 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.7 MB in the beginning and 159.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,638 INFO L168 Benchmark]: Boogie Preprocessor took 39.36 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,645 INFO L168 Benchmark]: RCFGBuilder took 832.76 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 107.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,646 INFO L168 Benchmark]: TraceAbstraction took 82020.01 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 106.6 MB in the beginning and 1.1 GB in the end (delta: -978.0 MB). Peak memory consumption was 869.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:32:01,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.42 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.7 MB in the beginning and 159.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.36 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.76 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 107.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82020.01 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 106.6 MB in the beginning and 1.1 GB in the end (delta: -978.0 MB). Peak memory consumption was 869.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6770 SDtfs, 10523 SDslu, 30458 SDs, 0 SdLazy, 25085 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 43 SyntacticMatches, 22 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5043 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 172466 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1322 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1239 ConstructedInterpolants, 0 QuantifiedInterpolants, 328121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...